jsoi2007建筑抢修

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=200010;
typedef long long ll;
struct node{
 ll x,y;
}s[maxn];
priority_queue<node,vector<node>,greater<node> > q;
bool operator > (node a,node b){
 return a.x<b.x;
}
bool cmp(node a,node b){
 return a.y<b.y;
}
ll n;
int main(){
 scanf("%lld",&n);
 for(int i=1;i<=n;i++){
  scanf("%lld%lld",&s[i].x,&s[i].y);
  q.push(s[i]);
 }
 //cout<<q.top().x<<endl;
 sort(s+1,s+1+n,cmp);
 //for(int i=1;i<=n;i++) cout<<s[i].x<<' '<<s[i].y<<endl;
 ll now=0,ans=0;
 for(int i=1;i<=n;i++){
  //cout<<"now "<<i<<' '<<now<<endl;
  if(now+s[i].x<=s[i].y){
   //cout<<i<<endl;
   ++ans; q.push(s[i]);
   now+=s[i].x;
  }
  else{
   node now1=q.top();
   if(now1.x>s[i].x){
    //cout<<i<<endl;
    //cout<<" 1 "<<now1.x<<endl;
    now-=(now1.x-s[i].x);
    q.pop();  q.push(s[i]);
   }
  }
 }
 cout<<ans<<endl;
 //cout<<now<<endl;
 return 0;
}