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;

#define N 2005

int n, m;
int tab[N];
int ans;

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	cin >> n >> m;
	for(int i = 0; i<n; i++) cin >> tab[i];
	sort(tab, tab+n, greater<int>());
	//cout << tab[0];

	ans = m;
	while (tab[ans] == tab[m-1]) ans++;
	cout << ans;
	
}