Submission #76453223

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

void O_O() {
    int n, k, m;
    cin >> n >> k >> m;

    array<int, 2> a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i][1] >> a[i][0];
    }
    sort(a, a + n);

    long long ans = a[n - 1][0];
    bool freq[n + 1];
    memset(freq, 0, sizeof freq);
    freq[a[n - 1][1]] = 1;
    for (int i = n - 2, c = 1; c != m; i--) {
        if (!freq[a[i][1]]) {
            freq[a[i][1]] = 1;
            ans += a[i][0];
            a[i][0] = -1;
            c++;
        }
    }

    for (int i = n - 2, c = 0; c < k - m; i--) {
        if (~a[i][0]) {
            ans += a[i][0];
            c++;
        }
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC;
    while (TC--) {
        O_O();
        if (TC) cout << '\n';
    }

    return 0;
}

Submission Info

Judge Result