1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <bits/stdc++.h>

using namespace std;
const int MAX = 2e3 + 7;
int t[MAX];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n; i++){
		cin >> t[i];
	}
	sort(t, t + n, greater<int>());
	int j = k, ans = k;
	while(t[j] == t[j-1]){
		ans++;
		j++;
	}
	cout << ans;
	return 0;
}