P2949 [USACO09OPEN]Work Scheduling G（反悔贪心）

P2949 [USACO09OPEN]Work Scheduling Ghttps://www.luogu.com.cn/problem/P2949

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

struct node {
	ll d, p;
};
node a[MAXN];

bool cmp(node x, node y) {
	if (x.d == y.d)
		return x.p > y.p;
	return x.d < y.d;
}
ll day = 0;
priority_queue<ll, vector<ll>, greater<ll> > que;

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld %lld", &a[i].d, &a[i].p);
	}
	sort(a + 1, a + n + 1, cmp);
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i].d > day) {
			que.push(a[i].p);
			ans += a[i].p;
			day++;
		} else {
			if (a[i].p > que.top()) {
				ans += -que.top() + a[i].p;
				que.pop();
				que.push(a[i].p);
			}
		}
	}
	printf("%lld", ans);
	return 0;
}