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

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;

    vector<int> a(n);

    for(int m=0;m<n;m++)
        cin>>a[m];

    sort(a.begin(),a.end());
    reverse(a.begin(),a.end());

    for(int m=k;m<n;m++)
    {
        if(a[m]==a[m-1])
            k++;
        else
            break;
    }

    cout<<k<<endl;
}