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

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    int tab [n];
    for(int i=0; i<n; i++)
        cin>>tab[i];
    sort(tab, tab+n);

    int ile = 1;

    for(int i = n-2; i>=0; i--)
    {
        if(tab[i] == tab[i+1])
            ile++;
        else if(ile >= m)
            break;
        else
            ile++;
    }

    cout<<ile;

    return 0;
}