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

using namespace std;

constexpr int N = 2007;
int tab[N];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie();
    int n,k;
    cin>>n>>k;
    for(int i=0;i!=n;i++)
        cin>>tab[i];
    sort(tab,tab+n,greater<int>()); k--;
    while(tab[k] == tab[k+1] && k < n)
        k++;
    cout<<k+1<<"\n";
    return 0;
}