P4053 [JSOI2007] 建筑抢修(反悔贪心)

P4053 [JSOI2007] 建筑抢修https://www.luogu.com.cn/problem/P4053

#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))


int n;
int day;
int ans;
struct node {
	int w, t;
} a[MAXN];
priority_queue<int> que;

bool cmp(node x, node y) {
	return x.t < y.t;
}

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