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
#include <bits/stdc++.h>
#include <iostream>
#include <vector>

using namespace std;

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

    int n, k;

    cin >> n;
    cin >> k;

    vector<int> ranking(n);

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

    sort(ranking.begin(), ranking.end(), greater<int>());

    int delta = 0;
    for (int i = k; i < n && ranking[i] == ranking[k - 1]; i++) {
        delta++;
    }

    cout << k + delta << endl;

    return 0;
}