Problem p02727 (C++)

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

using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl

template <class T> bool set_min(T &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <class T> bool set_max(T &a, const T &b) {
  return a < b ? a = b, true : false;
}
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &a : v)
    is >> a;
  return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (const T &t : v)
    os << "\t" << t;
  return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
  return os << "<" << v.first << ", " << v.second << ">";
}

const int INF = 1 << 30;
const ll INFL = 1LL << 60;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll X, Y, A, B, C;
  cin >> X >> Y >> A >> B >> C;
  vector<ll> P(A), Q(B), R(C);
  cin >> P >> Q >> R;
  sort(all(P));
  reverse(all(P));
  sort(all(Q));
  reverse(all(Q));
  sort(all(R));
  reverse(all(R));

  ll ans = 0;
  vector<ll> p, q;
  p.push_back(0);
  q.push_back(0);
  rep(i, X) {
    p.push_back(P[i]);
    ans += P[i];
  }
  rep(i, Y) {
    q.push_back(Q[i]);
    ans += Q[i];
  }
  for (ll r : R) {
    if (p.back() < q.back()) {
      if (r > p.back()) {
        ans -= p.back();
        ans += r;
        p.pop_back();
      }
    } else {
      if (r > q.back()) {
        ans -= q.back();
        ans += r;
        q.pop_back();
      }
    }
  }
  cout << ans << endl;
  return 0;
}


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

using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl

template <class T> bool set_min(T &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <class T> bool set_max(T &a, const T &b) {
  return a < b ? a = b, true : false;
}
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &a : v)
    is >> a;
  return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (const T &t : v)
    os << "\t" << t;
  return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
  return os << "<" << v.first << ", " << v.second << ">";
}

const int INF = 1 << 30;
const ll INFL = 1LL << 60;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll X, Y, A, B, C;
  cin >> X >> Y >> A >> B >> C;
  vector<ll> P(A), Q(B), R(C);
  cin >> P >> Q >> R;
  sort(all(P));
  reverse(all(P));
  sort(all(Q));
  reverse(all(Q));
  sort(all(R));
  reverse(all(R));

  ll ans = 0;
  vector<ll> p, q;
  p.push_back(INFL);
  q.push_back(INFL);
  rep(i, X) {
    p.push_back(P[i]);
    ans += P[i];
  }
  rep(i, Y) {
    q.push_back(Q[i]);
    ans += Q[i];
  }
  for (ll r : R) {
    if (p.back() < q.back()) {
      if (r > p.back()) {
        ans -= p.back();
        ans += r;
        p.pop_back();
      }
    } else {
      if (r > q.back()) {
        ans -= q.back();
        ans += r;
        q.pop_back();
      }
    }
  }
  cout << ans << endl;
  return 0;
}