#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
int main()
{
	int N,K;
	cin>>N>>K;
	map<int,int>cnt;
	for(;N--;)
	{
		int A;cin>>A;
		cnt[A]++;
	}
	vector<int>V;
	for(pair<int,int>p:cnt)V.push_back(p.second);
	sort(V.begin(),V.end());
	int ans=0;
	for(int i=V.size();K>0&&i--;)
	{
		K-=V[i];
		ans++;
	}
	cout<<ans<<endl;
}