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;
int kos[2000];
int a;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n >> k;
	for(int i = 0; i < n; ++i){
		cin >> a;
		kos[i] = -a;
	}
	
	sort(kos, kos + n);
	
	for(int i = k; i < n; ++i){
		if(kos[i] == kos[i-1]) ++k;
		else break;
	}
	
	cout << k;
}