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

using namespace std;
typedef long long int lli;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    lli n, k;
    cin >> n >> k;
    vector<lli> points(n);
    for (int i = 0; i < n; i++) {
        lli curr;
        cin >> curr;
        points[i] = curr;
    }
    sort(points.rbegin(), points.rend());
    while (k < n && points[k] == points[k-1]) {
        k++;
    }
    cout << k << '\n';
    return 0;
}