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

using namespace std;

int main(int argc, char const *argv[]) {
    int n, k;

    cin >> n >> k;

    vector<int> points(n);

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

    sort(
        points.begin(),
        points.end()
    );

    int result = -1;

    while (points[++result] < points[n - k]);

    cout << n - result << endl;

    return 0;
}