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

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k, tab[2000], res, min;
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        cin >> tab[i];
    }
    res = k;
    sort(tab, tab+n, greater<int>());
    min = tab[k-1];
    for (int i = k; i < n; ++i) {
        if (tab[i] == min) res++;
    }
    cout << res << endl;

    return 0;
}