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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
  int n,k;
  cin>>n>>k;
  vector<int>points(n);
  for(int i=0;i<n;i++){
    cin>>points[i];
  }
  sort(points.begin(),points.end());
  reverse(points.begin(),points.end());
  if(k>=n){
    cout<<k<<endl;
  }else{
    int lastlegit=points[k-1];
    int counter=0;
    int id=k-1;
    id++;
    while(lastlegit==points[id]){
      counter++;
      id++;
    }
    cout<<k+counter<<endl;
  }
  return 0;
}