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

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> points;
    points.resize(n, 0);
    for (int i = 0; i < n; ++i) {
        cin >> points[i];
    }
    sort(begin(points), end(points), greater());
    while (k < n && points[k - 1] == points[k]) {
        ++k;
    }
    cout << k;
}