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
#include <bits/stdc++.h>

using namespace std;


int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, k;
	cin >> n >> k;
	vector<int> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	sort(a.begin(), a.end());
	int ind = n-1;
	int ans = 0;
	while (ind+1 && k){
		ans += 1;
		ind--;
		k--;
		if (!k && ind != -1 && a[ind] == a[ind+1]){
			k++;
		}
	}
	cout << ans << endl;
	return 0;
}