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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

// BARTOSZ KAMIŃSKI RADOM

int main(){

    int a,b; cin >> a >> b;

    vector<int> tab(a,0);
    int g;
    for(int i = 0; i<a; ++i){
        cin >> g;
        tab[i] = g;
    }

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

    
    int u = 0;
    if(a == b)
        cout << b;
    else if(a>b){
        for(int i = a; i>0; --i){
            if(b>u){
                u++;
                continue;
            }
            if(tab[i] == tab[i-1])
                u++;
            else
                break;
        }
        cout << u;
    }
    
   
    
  
    return 0;
}