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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    vector<int>V(n);
    for(int &x : V)
        cin >> x;
    sort(V.begin(), V.end(), [](int a, int b){return a>b;});

    int extra = 0;
    while(k+extra<n && V[k+extra]==V[k-1])
        extra++;

    cout << k+extra << "\n";
    return 0;
}