1 #include<cstdio> 2 #include<queue> 3 #include<algorithm> 4 using namespace std; 5 priority_queue<int,vector<int> >Heap; 6 struct Point{int x,y;}; 7 bool cmp(const Point &a,const Point &b){return a.y<b.y;} 8 int n,v,used,ans=1; 9 Point a[150001];10 int main()11 {12     scanf("%d",&n);13     for(int i=1;i<=n;i++)scanf("%d%d",&a[i].x,&a[i].y);14     sort(a+1,a+n+1,cmp);15     used=a[1].x;Heap.push(a[1].x);16     for(int i=2;i<=n;i++)17       {18           if(used+a[i].x<=a[i].y)19             {20                 Heap.push(a[i].x);21                 used+=a[i].x;22                 ans++;23                 continue;24             }25           v=Heap.top();26           if(v>a[i].x)27             {28                 Heap.pop();29                 Heap.push(a[i].x);30                 used+=(a[i].x-v);31             }32       }33     printf("%d\n",ans);34 }