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>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k, a;
    cin >> n >> k;

    vector<int> points;
    for (int i = 0; i < n; i++) {
        cin >> a;
        points.push_back(-a);
    }

    sort(points.begin(), points.begin() + points.size());

    int i = k;

    while(i < n && points[i-1] == points[i]) {
        i++;
    }

    cout << i;
}