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
32
33
34
35
36
37
38
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int solve()
{
    int k,N;
    std::cin >> N;
    std::cin >> k;

    std::vector<int> A(N);
    for (int i=0;i<N;i++){
        int a;
        std::cin >> a;
        A[i] = a;
    }
    if (k == N){
        return k;
    }

    std::sort(A.begin(), A.end(), std::greater<int>());
    int lastTshirt = A[k-1];
    while(k<A.size()){
        if (A[k] == lastTshirt){
            k++;
        }
        else
        {
            return k;
        }
    }
    return k;
}
int main()
{
    std::cout << solve() << std::endl;
}