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

int main() {

    int n, k;
    std::cin >> n >> k;

    std::vector<int> points;

    for (int i = 0; i < n; i++) {
        int p;
        std::cin >> p;
        points.push_back(p);
    }

    std::sort(points.begin(), points.end(), std::greater<>());

    int last = points[k-1];

    while (k < points.size() && points[k] == last) {
        k++;
    }

    std::cout << k;

    return 0;
}