Problem p03183 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i, a, b) for (int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _                                                                      \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli, lli> ii;
typedef vector<int> vi;
typedef vector<lli> vl;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
#define deb(x) cout << #x ": " << (x) << endl;

const int N = 1e4 + 5;
const int INF = 1e9;
const lli MOD = 1e9 + 7;

vi primes(1, 2);
vector<vector<ld>> nk;
void sieve() {
  vi m(N + 1, 0);
  for (int i = 4; i < N; i += 2)
    m[i] = 1;
  for (int i = 3; i * i <= N; i += 2)
    if (!m[i])
      for (int j = i * i; j < N; j += i)
        m[j] = 1;
  for (int i = 3; i < N; i += 2)
    if (!m[i])
      primes.pb(i);
}

void pascal() {
  nk = vector<vector<ld>>(N, vector<ld>(N, 0.0));
  fore(i, 0, N) nk[i][0] = nk[i][i] = 1.0;
  fore(i, 1, N) fore(j, 1, i) nk[i][j] = nk[i - 1][j - 1] + nk[i - 1][j];
}

lli gcd(lli a, lli b) { return (b ? gcd(b, a % b) : a); }

lli lcm(lli a, lli b) {
  if (a < b)
    swap(a, b);
  lli c = gcd(a, b);
  a /= c;
  return a * b;
}

int popcount(lli x) { return __builtin_popcountll(x); }

lli poww(lli a, lli b) {
  lli res = 1;
  while (b) {
    if (b & 1)
      res = res * a;
    a = a * a;
    b /= 2;
  }
  return res;
}

lli powm(lli a, lli b) {
  lli res = 1;
  while (b) {
    if (b & 1)
      res = (res * a) % MOD;
    a = (a * a) % MOD;
    b /= 2;
  }
  return res;
}

bool isPrime(lli x) {
  if (x == 1)
    return 0;
  for (auto i : primes) {
    if (i * i > x)
      return 1;
    if (x % i == 0)
      return 0;
  }
  return 1;
}

lli SUM(lli a, lli b, lli mod = MOD) { return (a + b + mod) % mod; }
lli PROD(lli a, lli b, lli mod = MOD) {
  a %= mod;
  b %= mod;
  return a * b % mod;
}
int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, 1, -1, 0};

// ---- コーディングはここから！ ('-')7
struct S {
  lli w, s, v;
  bool operator<(const S &n) const { return ii{w + s, v} < ii{n.w + n.s, n.v}; }
};
void solve() {
  int n;
  cin >> n;
  vector<S> v(n);
  for (auto &[a, b, c] : v)
    cin >> a >> b >> c;
  sort(all(v));
  // for(auto &[a,b,c]:v)cout<<a<<b<<c<<ENDL;
  vvl dp(n, vl(N, -1));
  auto f = [&](auto f, int u, lli sum) -> lli {
    if (u == n)
      return 0;
    if (dp[u][sum] != -1)
      return dp[u][sum];
    lli res = f(f, u + 1, sum);
    if (v[u].s >= sum)
      res = max(res, f(f, u + 1, sum + v[u].w) + v[u].v);
    return dp[u][sum] = res;
  };
  cout << f(f, 0, 0) << ENDL;
}

int main() {
  _
  // int t; cin>>t; fore(tt,0,t)
  solve();
}


Fixed submission:
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i, a, b) for (int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _                                                                      \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli, lli> ii;
typedef vector<int> vi;
typedef vector<lli> vl;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
#define deb(x) cout << #x ": " << (x) << endl;

const int N = 1e4 + 5;
const int INF = 1e9;
const lli MOD = 1e9 + 7;

vi primes(1, 2);
vector<vector<ld>> nk;
void sieve() {
  vi m(N + 1, 0);
  for (int i = 4; i < N; i += 2)
    m[i] = 1;
  for (int i = 3; i * i <= N; i += 2)
    if (!m[i])
      for (int j = i * i; j < N; j += i)
        m[j] = 1;
  for (int i = 3; i < N; i += 2)
    if (!m[i])
      primes.pb(i);
}

void pascal() {
  nk = vector<vector<ld>>(N, vector<ld>(N, 0.0));
  fore(i, 0, N) nk[i][0] = nk[i][i] = 1.0;
  fore(i, 1, N) fore(j, 1, i) nk[i][j] = nk[i - 1][j - 1] + nk[i - 1][j];
}

lli gcd(lli a, lli b) { return (b ? gcd(b, a % b) : a); }

lli lcm(lli a, lli b) {
  if (a < b)
    swap(a, b);
  lli c = gcd(a, b);
  a /= c;
  return a * b;
}

int popcount(lli x) { return __builtin_popcountll(x); }

lli poww(lli a, lli b) {
  lli res = 1;
  while (b) {
    if (b & 1)
      res = res * a;
    a = a * a;
    b /= 2;
  }
  return res;
}

lli powm(lli a, lli b) {
  lli res = 1;
  while (b) {
    if (b & 1)
      res = (res * a) % MOD;
    a = (a * a) % MOD;
    b /= 2;
  }
  return res;
}

bool isPrime(lli x) {
  if (x == 1)
    return 0;
  for (auto i : primes) {
    if (i * i > x)
      return 1;
    if (x % i == 0)
      return 0;
  }
  return 1;
}

lli SUM(lli a, lli b, lli mod = MOD) { return (a + b + mod) % mod; }
lli PROD(lli a, lli b, lli mod = MOD) {
  a %= mod;
  b %= mod;
  return a * b % mod;
}
int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, 1, -1, 0};

// ---- コーディングはここから！ ('-')7
struct S {
  lli w, s, v;
  bool operator<(const S &n) const { return ii{w + s, v} < ii{n.w + n.s, n.v}; }
};
void solve() {
  int n;
  cin >> n;
  vector<S> v(n);
  for (auto &[a, b, c] : v)
    cin >> a >> b >> c;
  sort(all(v));
  // for(auto &[a,b,c]:v)cout<<a<<b<<c<<ENDL;
  vvl dp(n, vl(N, -1));
  auto f = [&](auto f, int u, lli sum) -> lli {
    if (u == n or sum >= N)
      return 0;
    if (dp[u][sum] != -1)
      return dp[u][sum];
    lli res = f(f, u + 1, sum);
    if (v[u].s >= sum)
      res = max(res, f(f, u + 1, sum + v[u].w) + v[u].v);
    return dp[u][sum] = res;
  };
  cout << f(f, 0, 0) << ENDL;
}

int main() {
  _
  // int t; cin>>t; fore(tt,0,t)
  solve();
}