求挂分原因

#include <bits/stdc++.h>
#define int long long
//#define double long double
using namespace std;
int n,cnt,m;
struct node{
	double val;
	int id;
}b[1000005];
bool cmp(node x,node y)
{
	return x.val<y.val;
}
signed main()
{
	freopen("candy3.in","r",stdin);
	freopen("candy.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++) 
	{
		int x,y;
		cin>>x>>y;
		b[++cnt].val=x;
		b[cnt].id=1;
		b[++cnt].val=(x+y)*1.0/2;
	}
	sort(b+1,b+cnt+1,cmp);
	int ans=0;
	for(int i=1;i<=cnt;i++)
	{
		if(b[i].id==0)
		{
			ans+=2*m/(b[i].val*2);
//			int x=2*m/(b[i].val*2);
//			m%=(int)(b[i].val*2);
			m-=(int)(2*m/(b[i].val*2))*b[i].val;
		}	
		else
		{
			if(b[i].val<=m)
			{
				m-=b[i].val;
				ans++;
			}
		}
	}
	cout<<ans<<'\n';
	return 0;
}