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 <string>
#include <vector>
#include <set>

using namespace std;

int main()
{
  int n, k, e;
  cin >> n >> k;
  multiset<int> s;
  for(int i =0; i < n; i++) {
    cin >> e;
    s.insert(e);
  }
  int counter = 0;
  int last = 0;
  for(auto it = s.rbegin(); it != s.rend(); it++) {
    counter++;
    if (counter == k) {
      last = *it;
    }
    if(last > *it) {
      counter--;
      break;
    }
  }
  cout << counter << endl;
  return 0;
}