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() {
    int n,k;
    cin>>n>>k;
    vector<int> a;
    for(int i=0; i<n; ++i) {
        int A;
        cin>>A;
        a.push_back(A);
    }
    sort(a.begin(),a.end());
    reverse(a.begin(),a.end());
    a.push_back(-1);
    int odp;
    for(odp=k-1; a[odp] == a[odp+1]; ++odp) {
        
    }
    cout<<odp+1<<endl;
    return 0;
}