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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std; 

int ilekoszulek(int n, int k, vector<int> a) {
	
	int ile = 0; 
	int max = 0; 
	int cmax = 121; 
	int ck = k; 

	while (ck > 0) {
		
		for (int i = 0; i < n; i++) {

			if (a[i] < cmax && a[i]>max) {
				max = a[i];
				ile = 1;
			}
			if (a[i] == max)
				ile++;
		}

		ck -= ile;

		if (k == 1)
			break; 
		
		cmax = max;
		max = 0; 
		ile = 0; 
	}
	return k - ck; 

}

int main()
{
	ios_base::sync_with_stdio(false);
	int n, k, ai;
	vector<int> a;
	cin >> n >> k; 

	for (int i = 0; i < n; i++) {
		cin >> ai;
		a.push_back(ai); 
	}

	cout << ilekoszulek(n, k, a); 

	return 0;
}