Language: C++

#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
typedef pair<int, int> P;
int dp[3010][3010];


signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, T;
    cin >> N >> T;
    P p[3010];
    rep(i, N) {
        cin >> p[i].first >> p[i].second;
    }
    sort(p, p + N);
    rep(i, N) {
        REP(j, 0, T - 1) {
            int c = min(T, j + p[i].first);
            dp[i + 1][c] = max(dp[i + 1][c], dp[i][max(0, c - 1)]);
            dp[i + 1][c] = max(dp[i + 1][c], dp[i][c]);
            dp[i + 1][c] = max(dp[i + 1][c], dp[i][j] + p[i].second);
        }
    }
    cout << dp[N][T] << endl;


    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:44:55: error: no matching function for call to 'max(int, long long int)'
   44 |             dp[i + 1][c] = max(dp[i + 1][c], dp[i][max(0, c - 1)]);
      |                                                    ~~~^~~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 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:44:55: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   44 |             dp[i + 1][c] = max(dp[i + 1][c], dp[i][max(0, c - 1)]);
      |                                                    ~~~^~~~~~~~~~
/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,
                 from a.cc:11:
/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:44:55: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   44 |             dp[i + 1][c] = max(dp[i + 1][c], dp[i][max(0, c - 1)]);
      |                                                    ~~~^~~~~~~~~~