Language: C++

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
typedef long long ll;
typedef pair<double,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef multiset<ll> S;
typedef priority_queue<ll> PQ;
typedef priority_queue<P,vector<P>,greater<P>> SPQ;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())outp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size()){rep(j,v[i].size()){if(j)cout<<' ';cout<<v[i][j];}cout<<'\n';}}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}

int main(){
    ll n,t;cin>>n>>t;
    vector<P> v(n);
    rep(i,n){
        ll a,b;cin>>a>>b;
        v[i]=P(a+1,a+b+1);
    }
    vector<P> s;
    vi u;
    rep(i,n){
        if(v[i].fi-1>0)s.eb(1.0*(v[i].fi-1)/(v[i].se-v[i].fi+1),i);
        else u.pb(v[i].se-v[i].fi+1);
    }
    sort(all(s));
    sort(all(u));
    n=s.size();
    if(n==0){
        ll sum=0;
        int j=0;
        while(j<u.size()&&sum+u[j]<=t)j++;
        out(j);
        return 0;
    }
    ll ans=0;
    vvi dp(n,vi(32,t+3));
    dp[0][0]=0;
    dp[0][1]=v[s[0].se].se;
    rep(i,n-1){
        rep(j,31){
            if(dp[i][j]>t)continue;
            ll id=s[i+1].se;
            if(dp[i][j]*v[id].fi+v[id].se<=t)chmin(dp[i+1][j+1],dp[i][j]*v[id].fi+v[id].se);
            chmin(dp[i+1][j],dp[i][j]);
        }
    }
    //outvv(dp);
    rep(i,32)if(dp[n-1][i]<=t){
        int cnt=0;
        while(cnt<u.size()&&u[cnt]+dp[n-1][i]<=t){
            dp[n-1][i]+=u[cnt];
            cnt++;
        }
        //cout<<i<<' '<<ub(rui,t-dp[n-1][i])<<endl;
        chmax(ans,i+cnt);
    }
    out(ans);
}


Compiler output:
a.cc: In function 'int main()':
a.cc:66:51: error: no matching function for call to 'chmin(__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type&, double)'
   66 |             if(dp[i][j]*v[id].fi+v[id].se<=t)chmin(dp[i+1][j+1],dp[i][j]*v[id].fi+v[id].se);
      |                                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:25:24: note: candidate: 'template<class T> bool chmin(T&, T)'
   25 | template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
      |                        ^~~~~
a.cc:25:24: note:   template argument deduction/substitution failed:
a.cc:66:51: note:   deduced conflicting types for parameter 'T' ('long long int' and 'double')
   66 |             if(dp[i][j]*v[id].fi+v[id].se<=t)chmin(dp[i+1][j+1],dp[i][j]*v[id].fi+v[id].se);
      |                                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~