1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, k; cin >> n >> k;
    vector<int> a(n + 1);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    a[n] = -100;
    sort(a.begin(), a.end(), greater<int>());
    for (int i = k; i <= n; i++) {
      if (a[i] != a[k - 1]) {
        cout << i << endl;
        break;
      }
    }
    return 0;
}