1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <iostream>
#include <set>

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    multiset<int> scores;
    for (int i = 0; i < n; ++i) {
        int score;
        cin >> score;
        scores.insert(score);
    }

    auto it = scores.end();
    advance(it, -k);
    int min_score = *it;

    auto last_person = scores.lower_bound(min_score);
    cout << distance(last_person, scores.end()) << '\n';

    return 0;
}