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

using namespace std;

void solve(){
    int n, k;
    cin >> n >> k;

    vector<int> vPoints(n+1, 0);

    for(int i = 0; i < n; i++) cin >> vPoints[i];

    sort(vPoints.begin(), vPoints.end(), greater<>());

    cout << (upper_bound(vPoints.begin(), vPoints.end(), vPoints[k-1], greater<>()) - vPoints.begin()) << "\n";
}

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

    solve();

    return 0;
}