D.cpp

//#pragma GCC optimize "trapv"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define vll vector<ll>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll power(ll x, ll y) {ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, MOD - 2);}

using namespace std;

int main()
{ quick;
#ifndef ONLINE_JUDGE
    freopen("D:/sublime/input.txt", "r", stdin);
    freopen("D:/sublime/output.txt", "w", stdout);
#endif
	int n,tim;
	cin>>n>>tim;
	int a[n],t[n];
	pair<int,int> comb[n];
	fab(0,n,i)
	{
		cin>>a[i]>>t[i];
		comb[i]={t[i],i};

	}
	int l=0,h=n;
	vector<int> ans;
	while(l<=h)
	{
		int mid=(l+h)>>1;
		//cout<<"mid:"<<mid<<endl;

		vector<pii> tm;
		fab(0,n,i)
		{
			if(a[i]>=mid)
				tm.pb({t[i],i});

		}
		
		sort(all(tm));
		int cnt=0;
		int tot=0;
		for ( auto i: tm)
		{
			if(cnt>=mid or tot> tim)
				break;
			tot+=i.f;
			cnt++;
			

		}
	//	cout<<"tot:"<<tot<<" "<<cnt<<endl;
		if(tot<=tim and cnt==mid)
		{
			ans.clear();
			fab(0,mid,i)
			ans.pb(tm[i].se+1);
			l=mid+1;

		}
		else
			h=mid-1;


	}
	
	ll sum=0;
	for(auto i: ans)
		sum+=(a[i-1]>=ans.size());
	cout<<sum<<endl;
	cout<<ans.size()<<endl;
	for(auto i: ans)
		cout<<i<<" ";
	cout<<endl;


	

 cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
	return 0;
}