1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
#include<iostream>
#include<vector>
#include <algorithm>

using namespace std;

int main(){
    int n, k;
    cin >> n >> k;
    vector<int> tshirts(n);
    for(int i=0;i<n;i++){
        cin >> tshirts[i];
    }
    sort (tshirts.rbegin(), tshirts.rbegin()+n);  
    int i = k-1;
    while(tshirts[i+1] == tshirts[k-1] && i+1 < n){
        i++;
    }
    cout << i+1 << endl;
}