求 T1 这个代码是否是对的

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n , m , maxn = 1e18;
struct node{
	int x , y;
} a[200005];
bool cmp(node x , node y){
	return x.x < y.x;
}
signed main(){
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i].x >> a[i].y;
		maxn = min(maxn , a[i].x + a[i].y);
	}
	sort(a + 1 , a + 1 + n , cmp);
	int ans = m / maxn * 2;
	for(int i = 1 ; i <= n ; i++){
		if(m >= a[i].x){
			m -= a[i].x;
			ans = max(ans , i + m / maxn * 2);
		}
	}
	cout << ans;
	return 0;
}