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
32
33
34
35
#include <bits/stdc++.h>
using namespace std;

vector <short> a;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k;
    cin>>n>>k;

    for(int i=0; i<n; ++i)
    {
        short x;
        cin>>x;
        a.push_back(x);
    }

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

    int wyn=k;
    int x=a[k-1];
    for(int i=k; i<n; ++i)
    {
        if(a[i]==x)
            ++wyn;
        else
            break;
    }
    cout<<wyn;
    return 0;
}