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
36
37
38
39
40
#include <bits/stdc++.h>

constexpr int MAXN = 2010;

using namespace std;

int n, k;

int a[MAXN];

bool cmp (int a, int b)
{
    return a > b;
}

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

    cin >> n >> k;

    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }

    sort(a + 1, a + n + 1, cmp);

    int res = k;

    for (int i = k + 1; i <= n; i++)
    {
        if (a[i] != a[k])
            break;
        
        res++;
    }

    cout << res;
}