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

const int N = 2000;

int results[N];

int n, k;

int main(){
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);

    std::cin >> n >> k;

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

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

    
    while(k < n && results[k] == results[k-1]){
        k++;
    }

    std::cout << k;

    return 0;
}