Submission #75258152

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
const long long INF = (1LL << 62) - (1LL << 31) - 1;
int di[4] = {-1,0,1,0};
int dj[4] = {0,-1,0,1};

int main() {
    int N, K;
    cin >> N >> K;
    ll s = 0;
    map<ll,ll> mp;
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        s += a;
        mp[a] += a;
    }
    vector<pair<ll,ll>> v;
    for (map<ll, ll>::iterator it = mp.begin(); it != mp.end(); it++) {
        v.push_back({ it->second, it->first });
    }
    sort(v.rbegin(), v.rend());

    for (int i = 0; i < K; i++) {
        if (i > (int)v.size()) {
            break;
        }
        s -= v[i].first;
    }
    cout << s << endl;
    return 0;
}

Submission Info

Judge Result