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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T> using Vec1 = vector<T>;
template <typename T> using Vec2 = vector<Vec1<T>>;
#define REP(i, m, n) for (ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for (ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for (ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for (ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> ll pow2(const T n) { return (1LL << n); }
template <typename T> void cosp(const T n) { cout << n << ' '; }
void co(void) { cout << '\\n'; }
template <typename T> void co(const T n) { cout << n << '\\n'; }
template <typename T1, typename T2> void co(pair<T1, T2> p) {
  cout << p.fs << ' ' << p.sc << '\\n';
}
template <typename T> void co(const Vec1<T> &v) {
  for (T i : v)
    cosp(i);
  co();
}
template <typename T> void co(initializer_list<T> v) {
  for (T i : v)
    cosp(i);
  co();
}
template <typename T> void ce(const T n) { cerr << n << endl; }
void sonic() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
constexpr int INF = 1e9 + 1;
constexpr ll LINF = 1e18 + 1;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);

struct rakuda {
  ll k, l, r;

  void input() { cin >> k >> l >> r; }
};

bool asc(rakuda &a, rakuda &b) { return a.k < b.k; }

void solve() {
  ll n;
  cin >> n;
  vector<rakuda> a(n);
  rep(i, n) a[i].input();

  sort(all(a), asc);
  vector<rakuda> b, c;
  rep(i, n) {
    if (a[i].l >= a[i].r)
      b.pb(a[i]);
    else
      c.pb(a[i]);
  }
  reverse(all(c));

  ll ans = 0;
  priority_queue<ll> pq;
  rep(i, b.size()) {
    ans += b[i].l;
    pq.push(b[i].r - b[i].l);
    while (pq.size() > b[i].k) {
      ans += pq.top();
      pq.pop();
    }
  }
  while (!pq.empty())
    pq.pop();
  rep(i, c.size()) {
    ans += c[i].r;
    pq.push(c[i].l - c[i].r);
    while (pq.size() > n - c[i].k) {
      ans += pq.top();
      pq.pop();
    }
  }
  co(ans);
}

int main(void) {
  ll t;
  cin >> t;
  rep(i, t) solve();

  return 0;
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T> using Vec1 = vector<T>;
template <typename T> using Vec2 = vector<Vec1<T>>;
#define REP(i, m, n) for (ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for (ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for (ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for (ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> ll pow2(const T n) { return (1LL << n); }
template <typename T> void cosp(const T n) { cout << n << ' '; }
void co(void) { cout << '\\n'; }
template <typename T> void co(const T n) { cout << n << '\\n'; }
template <typename T1, typename T2> void co(pair<T1, T2> p) {
  cout << p.fs << ' ' << p.sc << '\\n';
}
template <typename T> void co(const Vec1<T> &v) {
  for (T i : v)
    cosp(i);
  co();
}
template <typename T> void co(initializer_list<T> v) {
  for (T i : v)
    cosp(i);
  co();
}
template <typename T> void ce(const T n) { cerr << n << endl; }
void sonic() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
constexpr int INF = 1e9 + 1;
constexpr ll LINF = 1e18 + 1;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);

struct rakuda {
  ll k, l, r;

  void input() { cin >> k >> l >> r; }
};

bool asc(rakuda &a, rakuda &b) { return a.k < b.k; }

template <typename T> struct extended_priority_queue {
  priority_queue<T> a, b;

  bool empty() { return a.empty(); }

  void push(T x) { a.push(x); }

  T top() { return a.top(); }

  void pop() { erase(a.top()); }

  size_t size() { return a.size() - b.size(); }

  void erase(T x) {
    b.push(x);
    while (!a.empty() && a.top() == b.top()) {
      a.pop();
      b.pop();
    }
  }
};

void solve() {
  ll n;
  cin >> n;
  vector<rakuda> a(n);
  rep(i, n) a[i].input();

  sort(all(a), asc);

  priority_queue<P> pq;
  extended_priority_queue<P> epq, memo;
  ll ans = 0;
  rep(i, n) {
    if (a[i].l <= a[i].r) {
      ans += a[i].r;
      memo.push({-a[i].k, a[i].l - a[i].r});
      epq.push({a[i].l - a[i].r, a[i].k});
    } else {
      ans += a[i].l;
      pq.push({a[i].r - a[i].l, a[i].k});
    }
    while (pq.size() > a[i].k) {
      P t = pq.top();
      ans += t.fs;
      pq.pop();
    }
    while (!memo.empty() && memo.top().fs >= -pq.size()) {
      P t = memo.top();
      epq.erase({memo.top().sc, -memo.top().fs});
      memo.pop();
    }
    while (epq.size() > n - a[i].k) {
      P t = epq.top();
      ans += t.fs;
      epq.pop();
      memo.erase({-memo.top().sc, memo.top().fs});
    }
    // co(ans);
  }
  co(ans);
}

int main(void) {
  ll t;
  cin >> t;
  rep(i, t) solve();

  return 0;
}