1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN = 2000 + 7;
int tab[MAXN];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, k; cin>>n>>k;
	for(int i = 0; i < n; i++) cin>>tab[i];
	sort(tab, tab + n);
	reverse(tab, tab + n);
	int l = k;
	int key = tab[l - 1];
	while(l < n && tab[l] == key) l++;
	cout<<l<<'\n';
	return 0;
}