1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
#include <iostream>
#include <algorithm>
using namespace std;

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