ll@n,@t,@(a--,b)[n]; sortA(n,b,a); ll c[5d5],cn=0,ci=0; ll d[5d5],dn=0,di=0; char s[5d5]{}; rep(i,n){ ll x=a[i]; ll y=b[i]; if(s[x]){ d[dn++]=y; }else{ s[x]=1; c[cn++]=y; } } ll z=0; while(cit){ break; } if(d[di]>t){ break; } if(di==dn-1||d[di]+d[di+1]>=c[ci]){ t-=c[ci++]; z+=2; }else{ t-=d[di++]; z+=1; } } while(ci