CCF爆0，luogu 100

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 10;
int n, m, minid, minsum, minsumx, minsumy;
struct Node
{
	int x, y, sum, id;
} c[N];
bool cmp(const Node &A, const Node &B)
{
	return A.sum < B.sum;
}
bool cmp1(const Node &A, const Node &B)
{
	return A.x < B.x;
}
int check(int x)
{
	int mm = m - x * minsum, res = 0;
	for (int i = 1; i <= n; i++)
	{
		if (mm - c[i].x >= 0)
			mm -= c[i].x, res++;
	}
	return res + x * 2;
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	freopen("candy.in", "r", stdin);
	freopen("candy.out", "w", stdout);
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		cin >> c[i].x >> c[i].y;
		c[i].sum = c[i].x + c[i].y;
		c[i].id = i;
	}
	sort(c + 1, c + n + 1, cmp);
	minid = c[1].id, minsum = c[1].sum, minsumx = c[1].x, minsumy = c[1].y;
	sort(c + 1, c + n + 1, cmp1);
	int l = 0, r = m / minsum, ans = 0;
	while (l <= r)
	{
		int mid = (l + r) / 2, ac = mid + 1, res1, res2;
		if (l != r)
		{
			res1 = check(mid), res2 = check(ac);
			while (res1 == res2 && ac < r)
				res2 = check(++ac);
		}
		else
			res1 = res2 = check(mid);
		ans = max(ans, max(res1, res2));
		if (res1 < res2)
			l = mid + 1;
		else
			r = mid - 1;
	}
	cout << ans;
}