1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main(){
    int n,k;
    cin>>n>>k;
    vector<int> results(n);
    for(int i = 0; i < n; i++){
        cin>>results[i];
    }
    sort(results.begin(),results.end());
    reverse(results.begin(),results.end());
    if(n == k){
        cout<<k<<endl;
        return 0;
    }
    int how_many = k;
    for(int i = k-1; i < n-1 && results[i] == results[i+1]; i++){
        how_many++;
    }
    cout<<how_many<<endl;
    return 0;
}