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
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

vector<int> arr;

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

    int t;
    for (int i = 0; i < n; i++) {
        cin >> t;
        arr.push_back(t);
    }

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

    int q = k;

    int i1 = k - 1, i2 = k;
    for (int i = k; arr[i1] == arr[i2] && i2 < arr.size(); i++) {
        q++;
        i1++;
        i2++;
    }
    cout << q;
}