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
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    int* nums = new int[n];

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

    sort(nums, nums + n, greater<int>());

    int counter = 1;
    int i = 0;
    while (i < n and (i + 1 < k or (i + 1 < n and nums[i] == nums[i + 1]))) {
        counter++;
        i++;
    }

    cout << counter << "\n";

    return 0;
}