P4053 [JSOI2007]建筑抢修

// Problem: P2949 [USACO09OPEN]Work Scheduling G
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P2949
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 2022-03-11 20:30:08
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
const int N = 2e5 + 10;
int n, m;
struct node {
	int t, dead;
	
}p[N];
bool operator< (const node &q, const node &q2) {
		return q.t<q2.t;
}
void solve() {
	cin >> n;
	for (int i = 0; i < n; i ++) {
		cin >> p[i].t >> p[i].dead;
	}
	sort(p, p + n, [&](node & a, node &b) {
		return a.dead < b.dead;
	});

	priority_queue<node> heap;
	int last = 0;
	for (int i = 0; i < n; i ++) {
		if (p[i].dead >= last + p[i].t) {
			last += p[i].t;
			heap.push(p[i]);
		}
		else {
			if (heap.top().t > p[i].t) {
				last -= heap.top().t;
				heap.pop();
				heap.push(p[i]);
				last += p[i].t;
			}
		}
	}
	cout << heap.size() << endl;
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

堆维护的是耗时最长的。 加入堆需要满足的性质:前面所消耗的时间和当前消耗时间的和<=当前的deadLine 或者当前消耗的时间比堆定顶的大。因为我们要留时间给后面的建筑物