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
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 1e6;

int n, k;
int temp;

int t[ N_MAX ];


int main() {

	ios_base::sync_with_stdio(0);

	cin >> n >> k;

	if (k >= n){
		cout << n << '\n';
		return 0;
	}

	for (int i = 1; i <= n; ++i){
		cin >> t[ i ];
	}

	sort (t + 1, t + 1 + n, greater<int>());

	/*for (int i = 1; i <= n; ++i){
		cout <<  t[ i ] << " ";
	}
	cout << '\n';*/

	temp = t[ k ];

	int res = k;

	for (int i = k + 1; i <= n; ++i){
		if (t[ i ] == temp){
			res++;
		}
	}

	cout << res << '\n';

	return 0;
}