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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <iostream>
using namespace std;
void sort(int *tab, int lewy, int prawy)
{
	if(prawy <= lewy) return;
    
	int i = lewy - 1, j = prawy + 1, 
	pivot = tab[(lewy+prawy)/2]; 
	
	while(1)
	{
		while(pivot>tab[++i]);
		
		while(pivot<tab[--j]);
		
		if( i <= j)
			swap(tab[i],tab[j]);
		else
			break;
	}

	if(j > lewy)
	sort(tab, lewy, j);
	if(i < prawy)
	sort(tab, i, prawy);
}
int solve(){
    int n,k;
    cin>>n>>k;

    int *tab_1 = new int[n+2];
    int *tab = new int[n+2];
    
    for(int i=0;i<n;i++)
        cin>>tab_1[i];

    sort(tab_1,0,n-1);
    
    int t = 0;

    for(int i=n-1;i>=0;i--){
        tab[t] = tab_1[i];
        t++;
    }

    int x = 0,j = 0;

    for(int i=0;i<n;i++){
        if(tab[i] == tab[i+1])
            x++;
        else{
            j++;
            x++;
        }

        if(k == j)
            break;
    }

    delete [] tab;
    delete [] tab_1;

    return x;
}
int main(){

    cout<<solve()<<'\n';

    return 0;
}