1481. 不同整数的最少数目

static bool cmp(pair<int, int> p1, pair<int, int> p2) {
    return p1.second < p2.second;
}

int findLeastNumOfUniqueInts(vector<int> &arr, int k) {
    unordered_map<int, int> window;
    for (auto it:arr)
        window[it]++;

    pair<int, int> p[window.size()];
    int index = 0;
    for (auto it:window)
        p[index++] = it;

    sort(p, p + index, cmp);
    int i = 0;
    int num = k;
    for (; i < index; i++)
        if (num >= p[i].second)
            num -= p[i].second;
        else
            break;
    return index - i;
}