求代码证伪

#include<bits/stdc++.h>
#define int long long
using namespace std;
void read(int &x){
	x=0;bool f=0;char ch=getchar();
	while(ch>'9'||ch<'0'){
		if(ch=='-')f=1;
		ch=getchar();
	}do{x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}while(ch>='0'&&ch<='9');
	x=f?-x:x;
}
int n,m,s,k,mi,mx,my,p;
struct node{
	int x,y,id;
	bool operator<(node b){
		if(p)return x!=b.x?x<b.x:y!=b.y?y<b.y:id<b.id;
		return y!=b.y?y<b.y:x!=b.x?x<b.x:id<b.id;
	}
}a[100002];
signed main(){
	read(n),read(m);
	for(int i=1;i<=n;i++)read(a[i].x),read(a[i].y),a[i].y+=a[i].x,a[i].id=i;
	sort(a+1,a+1+n),mi=a[1].id,mx=a[1].x,my=a[1].y,s=m/my*2,m%=my,s+=(m>=mx),m-=mx*(m>=mx),k=s,p=1,sort(a+1,a+1+n),a[n+1].x=1e9+1;
	for(int i=1;i<=n;i++){
		if(a[i].id==mi)continue;
		if(m>=a[i].x)m-=a[i].x,s++;
//		else if(k<1)break;
		else if(k%2&&mx>=a[i].x)m+=mx-a[i].x,k--;
		else if(k%2==0&&my-mx>=a[i].x)m+=my-mx-a[i].x,k--;
		else if(k>1&&my>=a[i].x+a[i+1].x)m+=my-a[i].x,k-=2,s--;
		else break;
	}
	cout<<s;
	return 0;
}