[bzoj1029]建筑抢修

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 struct ji{
 4     int t,d;
 5 }a[200005];
 6 priority_queue<int>q;
 7 int n,ans;
 8 long long t;
 9 bool cmp(ji x,ji y){
10     return x.d<y.d;
11 }
12 int main(){
13     scanf("%d",&n);
14     for(int i=1;i<=n;i++)scanf("%d%d",&a[i].t,&a[i].d);
15     sort(a+1,a+n+1,cmp);
16     for(int i=1;i<=n;i++)
17         if (t+a[i].t<=a[i].d){
18             ans++;
19             t+=a[i].t;
20             q.push(a[i].t);
21         }
22         else{
23             t-=max(q.top()-a[i].t,0);
24             q.push(a[i].t);
25             q.pop();
26         }
27     printf("%d",ans);
28 }