1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;

	int points[n];
	for (int i = 0; i < n; ++i)
		cin >> points[i];
	
	sort(&points[0], &points[n], greater<int>());

	int l = k - 1;
	while (l < n - 1 && points[l] == points[l + 1])
		++l;

	cout << l + 1 << "\n";
	return 0;
}