求代码思路对不对

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5;
int n,m,sum = LONG_LONG_MAX,minx,ans,b[N + 5];
struct node{
	int x,y;
	bool operator < (const node &a) const{
		return a.x > x;
	}
};
node a[N + 5];
signed main(){
	cin >> n >> m;
	for(int i = 1;i <= n;i++){
		cin >> a[i].x >> a[i].y;
	}
	sort(a + 1,a + 1 + n);
	for(int i = 1;i <= n;i++){
		if(sum > a[i].x + a[i].y){
			sum = a[i].x + a[i].y;
			minx = a[i].x;
		}
	}
	for(int i = 1;i <= n;i++){
		if(a[i].x > sum / 2)
			break;
		m -= a[i].x;
		ans++;
	}
	int k = m / sum;
	m -= k * sum;
	ans += 2 * k;
	if(m > 0){
		for(int i = 1;i <= n;i++){
			if(a[i].x <= sum / 2)
				b[i] = a[i].y;
			else
				b[i] = a[i].x;
		}
		sort(b + 1,b + 1 + n);
		for(int i = 1;i <= n;i++){
			if(m >= b[i])
				m -= b[i],ans++;
			else
				break;
		}
	}
	cout << ans << endl;
}