???我真的查不出了

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=15000010;
int n; 
int tot, ans;
struct node{
	int tim,lim;
}a[N];
bool cmp(node a,node b)
{
	return a.lim<b.lim;
}
priority_queue<int>q;
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i].tim>>a[i].lim;
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)
	{
		if(tot+a[i].tim>a[i].lim)
		{
			if(a[i].tim<q.top());
			{
				tot-=q.top();
				tot+=a[i].tim;
				q.pop();
				q.push(a[i].tim);	
			}
		}else{
			tot+=a[i].tim;
			q.push(a[i].tim);
			ans++;
		}
	}
	//while(!q.empty())cout<<q.top()<<" ",q.pop();
	cout<<ans<<endl;
}