1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;


int main() {
    std::ios::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    vector<int> scores;
    scores.reserve(n);
    int sc;
    for(int i = 0; i < n; ++i) {
        cin >> sc;
        scores.push_back(sc);
    }
    sort(scores.begin(), scores.end(), greater<int>());
    while(k < n && scores[k] == scores[k - 1]) {
        ++k;
    }
    cout << k << endl;
}