Language: C++

#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
long long po(long a, long b){
    if(b==0){
        return 1;
    }
    
    long long z = po(a,b/2);
    z = mod(z*z);
    if(b%2!=0){
        z = mod(a*z);
    }
    return z;
}
 
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=std::sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}
 
long long gcd_(long long a, long long b){
  if(a<b){
    std::swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}
 
//using namespace std;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
 
int main(){
  using namespace std;
  int n;
  long long t;
  cin>>n>>t;
  long long a[n], b[n];
  vector<pair<double, int>> vi;
  vector<long long> bs;
  REP(i, n){
    cin>>a[i]>>b[i];
    if(a[i] == 0){
      bs.push_back(b[i]);
    }else{
      double d = (double)a[i]/((double)(b[i] + 1));
      vi.push_back(make_pair(-d, i));
    }
  }
  if(bs.size() == n){
    sort(ALL(bs));
    long long temp = 0;
    long long ans = 0;
    REP(i, n){
      temp += 1 + bs[i];
      if(temp <= t){
        ans++;
      }else{
        break;
      }
    }
    cout<<ans<<endl;
    return 0;
  }
  if(vi.size() == n){
    sort(ALL(vi));
    long long temp = 0;
    long long ans = 0;
    REP(j, n){
      int i = vi[j].second;
      temp++;
      temp = a[i] * temp + b[i];
      if(temp <= t){
        ans++;
      }else{
        break;
      }
    }
    cout<<ans<<endl;
    return 0;
  }
  sort(ALL(vi));
  sort(ALL(bs));
  int gnum = vi.size();
  int znum = bs.size();
  vector<vector<long long>> dp(gnum + 1, vector<long long>(31, INF));
  vector<long long> sbs(znum);
  REP(i, gnum + 1){
    dp[i][0] = 0;
  }
  REP(i, gnum + 1){
    REP(j, 31){
      if(j == 0){
        dp[i][j] = 0;
        continue;
      }
      if(i < j)continue;
      dp[i][j] = dp[i - 1][j];
      int ti = vi[i].second;
      long long temp = dp[i][j - 1] + 1 + a[ti] * (dp[i][j - 1] + 1) + b[ti];
      dp[i][j] = min(dp[i][j], temp);
      if(dp[i][j] > t)break;
    }
  }
  REP(i, znum){
    if(i == 0){
      sbs[i] = 1 + bs[i];
    }else{
      sbs[i] = sbs[i - 1] + 1 + bs[i];
    }
  }
  long long ans = 0;
  REP(i, gnum + 1){
    REP(j, 31){
      if(dp[i][j] > t)break;
      long long r = t - dp[i][j];
      auto itr = upper_bound(ALL(sbs), r);
      int cnt = distance(sbs.begin(), itr);
      ans = max(ans, j + cnt);
    }
  }
  cout<<ans<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:155:16: error: no matching function for call to 'max(long long int&, int)'
  155 |       ans = max(ans, j + cnt);
      |             ~~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:155:16: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
  155 |       ans = max(ans, j + cnt);
      |             ~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:155:16: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
  155 |       ans = max(ans, j + cnt);
      |             ~~~^~~~~~~~~~~~~~