队列RE，求助

#include<bits/stdc++.h>
#define ll long long 
using namespace std;
ll a[100005];
int main()
{
	ll n,m,t=0,h=0,ans=0;
	cin>>n>>m;
	for(ll i=0;i<n;i++) cin>>a[i];
	sort(a,a+n);
	t=n-1;
	while(t>=h)
	{
		ll tt=a[t];
		ll tm=tt;
		for(ll i=0;i<t;i++)
		{
			if(tm+a[i]<=m) 
			{
				cout<<a[i]<<' ';
				tm+=a[i];
				h++;
			}
			else 
			{
				if(tm+a[i]>m)
				{
					ans++;
					cout<<endl;
					break;
				}
			}
		}
		t--;
	}
	cout<<ans;
	return 0;
}