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

using namespace std;
int main()
{
    int kos[2000], n,k;
    ios_base::sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        cin >> kos[i];
    }

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

    int res = k-1;

    while (res + 1 < n && kos[res + 1] == kos[res])
    {
        res++;
    }

    cout << res + 1;
}