1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n, k;

	cin >> n >> k;

	vector<int> score(n);

	for (int i = 0; i < n; ++i)
	{
		cin >> score[i];
	}

	sort(score.begin(), score.end(), greater<int>());

	int res = k;

	while (res < n && score[res] == score[k - 1])
		++res;

	cout << res << endl;

	return 0;
}