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
33
34
35
36
#include <bits/stdc++.h>

using namespace std;

int MAX_N = 2000;
int n, k;
vector<int> a(MAX_N, 1);

void loadData() {
    cin >> n >> k;
    
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
}

int solve() {
    sort(a.begin(), a.end(), greater<int>());
    int max = a[k - 1];
    for (int i = k; i < n; ++i) {
        if (a[i] < max) {
            return i;
        }
    }
    
    return n;
}

int main() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    loadData();
    cout << solve() << '\n';
    return 0;
}