1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int pkt[2009];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n,k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
        cin >> pkt[i];
    sort(pkt+1, pkt+n+1, greater<int>());
    while(pkt[k] == pkt[k+1])
        k++;
    cout << k << "\n";

    return 0;
}