AOJ1353.cpp

#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

typedef long long ll;

ll INF = 1e16;

int N, R[256], S[256];

ll memo[160][50000];
bool flag[160][50000];

ll dp(int n, int s) {
  if (n == N) return s <= 0 ? -INF : INF;
  if (flag[n][s+25000]) return memo[n][s+25000];
  ll a = -dp(n+1, -s+S[n]+1) - R[n] + 1;
  ll b = dp(n+1, s+S[n]) + R[n] + 1;
  flag[n][s+25000] = true;
  return memo[n][s+25000] = min(a, max(1LL, b));
}

int main() {
  int A, B;
  cin >> N >> A >> B;
  ll sum = 0;
  REP(i,N) {
    cin >> R[i] >> S[i];
    sum += S[i];
  }
  for (int i = 0;; ++i) {
    if (dp(0, sum - 2 * i) <= A - B) {
      cout << sum - i << " " << i << endl;
      return 0;
    }
  }
  return 0;
}