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
#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int n,k;

vector <int> results;

bool desc (int i,int j) { return (i>j); }

int main(){
	scanf("%d %d", &n, &k);
	int d;
	for(int i=0;i<n;++i){
		scanf("%d", &d);
		results.push_back(d);
	}


	sort(results.begin(), results.end(), desc);

	int shirts = k;
	int last_val = results[k-1];

	for(int i=k;i<n;++i){
		if(results[i] != last_val){
			break;
		}

		shirts++;
	}

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

	return 0;
}