#include<bits/stdc++.h> using namespace std; int n; struct s{ int c; int t; }a[150002]; bool cmp(s x,s y){ return x.t<y.t; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].c>>a[i].t; } sort(a,a+n,cmp); priority_queue<int> pq; long long now=0; for(int i=1;i<=n;i++){ now+=a[i].c; pq.push(a[i].c); if(now>a[i].t){ now-=pq.top(); pq.pop(); } } cout<<pq.size(); return 0; }