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
#include <iostream>
#include <algorithm>

using namespace std;

int n, k, tab[2000];
int main()
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	cin >> n >> k;

	for (int i = 0; i < n; i++)
		cin >> tab[i];

	sort(tab, tab + n);

	//int wyn = k;
	while (k < n)
		if (tab[n - k] == tab[n - k - 1])
			k++;
		else
			break;

	cout << k;
	return 0;
}