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

using namespace std;

bool srt(int a, int b) {
	if (a >= b) {
		return true;
	}
	else {
		return false;
	}
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);
	int n, k, xd = 0;

	cin >> n >> k;
	int a[n+1];

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

	sort(a, a + n, srt);
	a[n] = 0;
	for (int i = 0; i < n; i++) {
		xd++;
		if (a[i + 1] < a[i] && xd >= k) {
			break;
		}
	}
	cout << xd;

}