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

using namespace std;

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    v.push_back(-a);
  }
  sort(v.begin(), v.end());

  int res = k - 1;
  while (res + 1 != (int)v.size() && v[res] == v[res + 1]) {
    ++res;
  }
  cout << res + 1 << endl;
}