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
#include <bits/stdc++.h>

using namespace std;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, k;
    cin >> n >> k;
    vector<int> points(n);

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

    std::sort(points.rbegin(), points.rend());

    int count = k;
    int last = points[k - 1];
    for (int i = k; i < n; ++i) {
        if (points[i] == last) {
            ++count;
        }
        else {
            break;
        }
    }

    cout << count;

    return 0;
}