This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  const long long inf = (long long) 1e18;
  vector<long long> dp(2 * n + 1, -inf);
  dp[n + 1] = 0;
  for (int i = 0; i < n; i++) {
    auto new_dp = dp;
    for (int bal = -n; bal <= n; bal++) {
      int new_bal = min(n, bal - 1 + a[i]);
      if (new_bal >= -n) {
        new_dp[new_bal + n] = max(new_dp[new_bal + n], dp[bal + n] + b[i]);
      }
    }
    swap(dp, new_dp);
  }
  long long res = 0;
  for (int i = 0; i <= n; i++) {
    res = max(res, dp[n + i]);
  }
  cout << res << '\n';
  return 0;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |