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

using namespace std;

int n, k, p;
vector<int> a;

int main(){
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n; i++){
		scanf("%d", &p);
		a.push_back(p);
	}
	sort(a.begin(), a.end());
	int i = n - k - 1;
	while(i >= 0 && a[i] == a[i + 1]) i--;
	printf("%d\n", n - i - 1);
}