1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <iostream>
#include <algorithm>

using namespace std;

int main() {
	int n, k, licz;

	cin >> n >> k;
	licz = k;

    int T[n];

    for(int i = 0; i < n; i++) cin >> T[i];

    sort(T,T+n);
    reverse(T,T+n);

    while(licz < n && T[licz-1] == T[licz]) licz++;

    cout << licz;
	return 0;
}