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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;

    vector<int> tab(n);

    for(int i=0;i<n;i++)
    {
        cin>>tab[i];
    }

    sort(tab.begin(),tab.end());

    vector<int> how_many_of_each;

    int counter=1;

    for(int i=1;i<n;i++)
    {
        if(tab[i]==tab[i-1])
        {
            counter++;
        }
        else
        {
            how_many_of_each.push_back(counter);
            counter=1;
        }
    }

    how_many_of_each.push_back(counter);

    int shirts=0;
    int id=how_many_of_each.size()-1;

    while (shirts<k)
    {
        shirts+=how_many_of_each[id];
        id--;
    }
    
    cout<<shirts<<endl;

    return 0;
}