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() {
    ios_base::sync_with_stdio(0);
    int n, k;
    cin >> n >> k;
    vector<int> pts(n);
    for(int i = 0; i < n; ++i) {
        cin >> pts[i];
    }
    sort(pts.begin(), pts.end());
    while(n - k - 1 >= 0 && pts[n - k - 1] == pts[n - k]) {
        ++k;
    }
    cout << k << "\n";
}