1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
#include<iostream>
#include<string>
#include<algorithm>

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    int* r=new int[n];

    for(int i=0;i<n;i++)
        cin>>r[i];
    sort(r,r+n);
    int i=0;
    while(n-k-i>=0 && r[n-k]==r[n-k-i])i++;
    cout<<k+i-1;
    return 0;
}