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
#include "stdio.h"
#include <vector>
#include <algorithm>

using namespace std;

bool order (int i,int j) { return (j < i); }

int main(){

	int n, k;

	scanf("%d %d", &n, &k);

	vector<int> v;

	for (int i = 0; i < n; i++) {
		int a;
		scanf("%d", &a);
		v.push_back(a);
	}
		
	sort(v.begin(), v.end(), order);

	int last = v[k - 1];
	int i = k;
	for (; i < n; i++) {
		if (v[i] != last){
			break;
		}
	}

	printf("%d\n", i);
	



	


}