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
30
31
#include <bits/stdc++.h>
using namespace std;
constexpr int maxN = 2e3+7;

int n,k,t[maxN],ans;

int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

cin>>n>>k;
for(int i=1;i<=n;i++)
    cin>>t[i];
sort(t+1,t+1+n,greater<int>());
ans = k;
int i=k+1;
while(i <= n && t[i] == t[k])
{
    i++;
    ans++;
}
cout<<ans;
}
/*

5 3
75 90 120 75 40

*/