Problem p03163 (C++)

Buggy submission (status: Memory Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<int, int>
#define mpi map<pii, int>
#define msi map<string, int>
#define loop(i, s, e) for (int i = s; i < e; i++)
#define rloop(i, e, s) for (int i = e; i >= s; i--)
#define mset(a, f) memset(a, f, sizeof(a))
#define spi set<pii>
#define endl "\n"
#define sz(x) ((int)x.size())
#define all(p) p.begin(), p.end()
#define que_max priority_queue<int>
#define que_min priority_queue<int, vi, greater<int>>
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define print(a)                                                               \
  for (auto x : a)                                                             \
    cout << x << " ";                                                          \
  cout << endl
#define Print(a, x, y)                                                         \
  for (int i = x; i < y; i++)                                                  \
    cout << a[i] << " ";                                                       \
  cout << endl

inline int power(int a, int b) {
  int x = 1;
  while (b) {
    if (b & 1)
      x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
  cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}

const int N = 2000005;
int v[N], w[N], n, maxwt;
int dp[105][N];

int help(int i, int wt) {
  if (i >= n)
    return 0;
  if (dp[i][wt] != -1)
    return dp[i][wt];
  int op1 = -1, op2 = -1;
  if (w[i] <= wt)
    op1 = v[i] + help(i + 1, wt - w[i]);
  op2 = help(i + 1, wt);
  return dp[i][wt] = max(op1, op2);
}

void solve() {
  cin >> n >> maxwt;
  loop(i, 0, n) cin >> w[i] >> v[i];
  mset(dp, -1);
  cout << help(0, maxwt);

  return;
}

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

#define int long long int
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define si set<int>
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define vpp vector<pair<int, pii>>
#define mii map<int, int>
#define mpi map<pii, int>
#define msi map<string, int>
#define loop(i, s, e) for (int i = s; i < e; i++)
#define rloop(i, e, s) for (int i = e; i >= s; i--)
#define mset(a, f) memset(a, f, sizeof(a))
#define spi set<pii>
#define endl "\n"
#define sz(x) ((int)x.size())
#define all(p) p.begin(), p.end()
#define que_max priority_queue<int>
#define que_min priority_queue<int, vi, greater<int>>
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define print(a)                                                               \
  for (auto x : a)                                                             \
    cout << x << " ";                                                          \
  cout << endl
#define Print(a, x, y)                                                         \
  for (int i = x; i < y; i++)                                                  \
    cout << a[i] << " ";                                                       \
  cout << endl

inline int power(int a, int b) {
  int x = 1;
  while (b) {
    if (b & 1)
      x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
  cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}

const int N = 2000005;
int v[N], w[N], n, maxwt;
int dp[105][100005];

int help(int i, int wt) {
  if (i >= n)
    return 0;
  if (dp[i][wt] != -1)
    return dp[i][wt];
  int op1 = -1, op2 = -1;
  if (w[i] <= wt)
    op1 = v[i] + help(i + 1, wt - w[i]);
  op2 = help(i + 1, wt);
  return dp[i][wt] = max(op1, op2);
}

void solve() {
  cin >> n >> maxwt;
  loop(i, 0, n) cin >> w[i] >> v[i];
  mset(dp, -1);
  cout << help(0, maxwt);

  return;
}

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }

  return 0;
}