Problem p03163 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a)                                                                 \
  { cout << a << "\n"; }
#define tell(a, b)                                                             \
  { cout << a << " | " << b << "\n"; }
#define telll(a, b, c)                                                         \
  { cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n)                                                             \
  {                                                                            \
    cout << "v- ";                                                             \
    rep(i, 0, n) cout << v[i] << " ";                                          \
    cout << "\n";                                                              \
  }
#define IOS                                                                    \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0);
using namespace std;
#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
#else
#define trace(...)
#endif

#define M 110
#define N 100010

ll w[M], v[M];
ll dp[M][N];
ll f(ll pos, ll wt) {
  if (wt < 0)
    return -1 * inf;
  if (pos < 0)
    return 0;
  if (dp[pos][wt] != -1)
    return dp[pos][wt];
  ll ans = max(f(pos - 1, wt), f(pos - 1, wt - w[pos]) + v[pos]);
  trace(pos, wt, ans);
  return dp[pos][wt] = ans;
}
int main() {
  IOS;
  // freopen("inp.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);

  ll n, W;
  cin >> n >> W;
  rep(i, 0, n) cin >> w[i] >> v[i];

  memset(dp, -1, sizeof(dp));
  f(n - 1, W);
  ll ans = -1;
  rep(i, 0, N) ans = max(ans, dp[n - 1][i]);
  cout << ans;

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a)                                                                 \
  { cout << a << "\n"; }
#define tell(a, b)                                                             \
  { cout << a << " | " << b << "\n"; }
#define telll(a, b, c)                                                         \
  { cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n)                                                             \
  {                                                                            \
    cout << "v- ";                                                             \
    rep(i, 0, n) cout << v[i] << " ";                                          \
    cout << "\n";                                                              \
  }
#define IOS                                                                    \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0);
using namespace std;
#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
#else
#define trace(...)
#endif

#define M 110
#define N 100010

ll w[M], v[M];
ll dp[M][N];
ll f(ll pos, ll wt) {
  if (wt < 0)
    return -1 * inf;
  if (pos < 0)
    return 0;
  if (dp[pos][wt] != -1)
    return dp[pos][wt];
  ll ans = max(f(pos - 1, wt), f(pos - 1, wt - w[pos]) + v[pos]);
  // trace(pos,wt,ans);
  return dp[pos][wt] = ans;
}
int main() {
  IOS;
  // freopen("inp.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);

  ll n, W;
  cin >> n >> W;
  rep(i, 0, n) cin >> w[i] >> v[i];

  memset(dp, -1, sizeof(dp));
  f(n - 1, W);
  ll ans = -1;
  rep(i, 0, N) ans = max(ans, dp[n - 1][i]);
  cout << ans;

  return 0;
}