#include <bits/stdc++.h> 

using namespace std;


int main() {
    int n, k;
    cin >> n >> k;
    vector<int> cnt;
    map<int, int> mp;
    for (int i = 1; i <= n; ++i) {
        int x;
        cin >> x;
        mp[x]++;
    }      
    for (auto it : mp) {
        cnt.push_back(it.second);
    }  
    sort(cnt.begin(), cnt.end(), greater<int>());
    int ans = 0;
    for (int i = 0; i < (int)cnt.size(); ++i) {
        if (k >= cnt[i]) ans++, k -= cnt[i];
        else if (k) ans++, k = 0;
        else break;
    }
    cout << ans;
    return 0;
}