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
28
29
30
31
32
33
#include <bits/stdc++.h>
#pragma GCC optimize(0fast)
#define BOOST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define st first
#define nd second
#define pb push_back
#define INF 1000000000
#define mil 1000000
#define modulo 1000000007
using namespace std;
typedef long long ll;

using namespace std;
int tab[1000001];
bool cmp(int a, int b){
	return a > b;
}
int main(){
	BOOST;
	int n,k; cin >> n >> k;
	for(int i=0; i<n; i++){
		cin >> tab[i];
	}
	sort(tab, tab + n,cmp);
	int x = tab[k-1];
	int res = k;
	for(int i=k; i<n; i++){
		if(tab[i] != x)
			break;
		res++;
	}
	cout << res << "\n";
}