Submission #3456124

---

Source Code Expand

#include<iostream>
#include <string>
#include<vector>
#include<algorithm>
typedef long long ll;

using namespace std;
int main()
{
	int n,k;
	cin >> n>>k;
	vector<int> box(200001,0);
	for (int i = 0; i < n; i++) {
		int dammy;
		cin >> dammy;
		box[dammy] += 1;
	}
	sort(box.begin(), box.end(), greater<int>());

	int kotae = 0;
	for (int i = k; i < box.size(); i++) {
		kotae += box[i];
	}
	cout << kotae;
	return 0;
}

Submission Info

Judge Result