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
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

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

    sort(a, a + n, greater<>());

    int r = k, t = a[k - 1];
    for (int i = k; i < n; ++i) {
        if (t == a[i]) {
            ++r;
        } else {
            break;
        }
    }

    cout << r;
    return 0;
}