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

const int MAX_N = 2e3;

int n, k;
int arr[MAX_N + 5];

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

    cin >> n >> k;
    for (int i = 0; i < n; ++i)
        cin >> arr[i];

    sort(arr, arr + n, std::greater<int>());

    int it = k;
    while (it < n && arr[it] == arr[it - 1])
        ++it;

    cout << it << "\n";

    return 0;
}