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() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k, e;
    cin >> n >> k;

    vector<int> shirts(n);
    for (int i = 0; i < n; i++) {
        cin >> e;
        shirts.push_back(e);
    }
    sort(shirts.begin(), shirts.end(), greater<int>());

    for (; k < n; k++) {
        if (shirts[k] != shirts[k - 1]) {
            break;
        }
    }
    cout << k;

    return 0;
}