Submission #6818295

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#define ll long long
#define mod 1000000007

vector<int> v[100001];

int main(){
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
        int n, k; cin >> n>> k;
        lp(i, n) { int a, b; cin >> a>> b; v[a].push_back(b); }
        lp(i, 100001) if (sz(v[i])) sort(all(v[i]));
        int cur = k - 1, pos = 1, an = 0;
        priority_queue <int> pq;
        while ( cur-- >= 0 ) {
                lp(i, sz(v[pos])) { pq.push(v[pos][i]); }
                if (sz(pq)) { an += pq.top(); pq.pop(); }
                pos++;
        }
        cout << an;
return 0;
}

Submission Info

Judge Result