【JSOI2007】【Bzoj1029】建筑抢修

 1 #include<cstdio>
 2 #include<algorithm>
 3 #include<queue>
 4 using namespace std;
 5 const int maxn=150010;
 6 struct data{
 7     int la,e;
 8 }a[maxn];
 9 int n;
10 priority_queue <int> que;
11 bool cmp(const data &x,const data &y){
12     return x.e<y.e;
13 }
14 int main(){
15     scanf("%d",&n);
16     for (int i=1; i<=n; i++) scanf("%d%d",&a[i].la,&a[i].e);
17     sort(a+1,a+n+1,cmp);
18     long long now=0,ans=0;
19     for (int i=1; i<=n; i++){
20         int last=a[i].la;
21         int en=a[i].e;
22         if (now+last<=en){
23             ans++;
24             now+=last;
25             que.push(last);
26         }
27         else {
28             int tmp=que.top();
29             if (tmp>last){
30                 que.pop();
31                 now=now-tmp+last;
32                 que.push(last);
33             }
34         }
35     }
36     printf("%d\n",ans);
37     return 0;
38 }