Problem p01622 (C++) — buggy submission, verdict: Runtime Error

#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
  out << '[';
  REP(i, a.size()) {
    out << a[i];
    if (i != a.size() - 1)
      out << ',';
  }
  out << ']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int dp[1010][3010];
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);

  while (true) {
    int n;
    cin >> n;
    if (!n)
      break;
    VI r(n), w(n);
    int sumr = 0, sumw = 0;
    int ma = 0, idx = -1;
    REP(i, n) {
      cin >> r[i] >> w[i];
      if (ma < r[i]) {
        ma = r[i];
        idx = i;
      }
      sumr += r[i];
      sumw += w[i];
    }

    if (ma <= sumr - ma) {
      cout << sumr + sumw << endl;
    } else {
      // r.back() - (sumr - r.back()) = 2*r.back() - sumr にできるだけ近づける
      memset(dp, 0, sizeof(dp));
      dp[0][0] = 1;
      REP(i, n) REP(j, 2 * ma - sumr + 1) {
        dp[i + 1][j] |= dp[i][j];
        if (j + w[i] <= 2 * ma - sumr && i != idx)
          dp[i + 1][j + w[i]] |= dp[i][j];
      }

      int tmp = -1;
      REP(i, 2 * ma - sumr + 1) if (dp[n][i] == 1) chmax(tmp, i);

      cout << ma * 2 + sumw - tmp << endl;
    }
  }

  return 0;
}


Error: 0

Fixed submission:

#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
  out << '[';
  REP(i, a.size()) {
    out << a[i];
    if (i != a.size() - 1)
      out << ',';
  }
  out << ']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int dp[55][50010];
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);

  while (true) {
    int n;
    cin >> n;
    if (!n)
      break;
    VI r(n), w(n);
    int sumr = 0, sumw = 0;
    int ma = 0, idx = -1;
    REP(i, n) {
      cin >> r[i] >> w[i];
      if (ma < r[i]) {
        ma = r[i];
        idx = i;
      }
      sumr += r[i];
      sumw += w[i];
    }

    if (ma <= sumr - ma) {
      cout << sumr + sumw << endl;
    } else {
      // r.back() - (sumr - r.back()) = 2*r.back() - sumr にできるだけ近づける
      memset(dp, 0, sizeof(dp));
      dp[0][0] = 1;
      REP(i, n) REP(j, 2 * ma - sumr + 1) {
        dp[i + 1][j] |= dp[i][j];
        if (j + w[i] <= 50000 && i != idx)
          dp[i + 1][j + w[i]] |= dp[i][j];
      }

      int tmp = -1;
      REP(i, 2 * ma - sumr + 1) if (dp[n][i] == 1) chmax(tmp, i);

      cout << ma * 2 + sumw - tmp << endl;
    }
  }

  return 0;
}