bzoj1572 [Usaco2009 Open]工作安排Job

# include <queue>
# include <stdio.h>
# include <string.h>
# include <iostream>
# include <algorithm>
// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int M = 5e5 + 10;
const int mod = 1e9+7;

# define RG register
# define ST static

int n;
struct pa {
    int d, p;
    pa () {}
    pa (int d, int p) : d(d), p(p) {}
    friend bool operator < (pa a, pa b) {
        return a.p > b.p || (a.p == b.p && a.d < b.d);
    }
}p[M];

priority_queue<pa> q;

inline bool cmp(pa a, pa b) {
    return a.d < b.d;
}


int main() {
    cin >> n;
    for (int i=1; i<=n; ++i) scanf("%d%d", &p[i].d, &p[i].p);
    sort(p+1, p+n+1, cmp);
    for (int i=1; i<=n; ++i) {
        if(q.size() < p[i].d) q.push(p[i]);
        else if(p[i].p > q.top().p) {
            q.pop();
            q.push(p[i]);
        }
    }
    ll ans = 0;
    while(!q.empty()) {
        ans += q.top().p;
        q.pop();
    }
    cout << ans << endl;
    return 0;
}