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

#include <bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
//     #pragma GCC optimize("unroll-loops")
//     #pragma GCC optimize("Ofast")
//     #pragma GCC optimize("-O3")
//     #pragma GCC optimize("no-stack-protector")
//     #pragma GCC optimize("fast-math")
// #define LOCAL
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io                                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);                                                                 \\
  ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles                                                               \\
  ifstream cin("input.txt");                                                   \\
  ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll) x.size()
#define endl "\\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)

// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi = 3.14159265359;
ll inf = 1e18, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
ll binmult(ll a, ll b, ll mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R = 1e4;
const ll tx[4] = {0, 0, -1, 1};
const ll ty[4] = {-1, 1, 0, 0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int N = 1e5 + 1;
const int M = 1e9 + 7;
// typedef
// tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
// int n,m,k;
// int a[N],b[N];
int n;
int get_p(vector<int> &p, int v) {
  return (p[v] == v || p[v] == n || p[v] == n - 1 ? p[v]
                                                  : p[v] = get_p(p, p[v]));
}
signed main() {
  int t;
  cin >> t;
  while (t--) {
    //  int n;
    cin >> n;
    vector<int> a(n), b(n), c(n);
    vector<pii> ne, d, s;
    ll ans = 0;
    // need ->выгоднее их поставить туда // d-> невыгодно// вообще по
    for (int i = 0; i < n; i++) {
      cin >> a[i] >> b[i] >> c[i];
      --a[i];
      if (b[i] > c[i]) {
        ne.p_b({b[i] - c[i], a[i]});
        ans += c[i];
      } else if (b[i] <= c[i]) {
        d.p_b({c[i] - b[i], a[i]});
        ans += b[i];
      }
    }
    set<int> st;
    for (int i = 0; i < n; i++)
      st.insert(i);
    sort(rall(d));
    sort(rall(ne));
    int l = 0;
    for (auto &z : ne) {
      auto it = st.upper_bound(z.s);
      if (it == st.begin()) {
        d.p_b({0, z.s});
        continue;
      }
      st.erase(--it);
      l++;
      ans += z.f;
    }
    st.clear();
    for (int i = l; i < n; i++) {
      st.insert(i);
    }
    for (auto &z : d) {
      auto it = st.upper_bound(z.s);
      if (it == st.end()) {
        continue;
      }
      st.erase(it);
      ans += z.f;
    }
    cout << ans << endl;
  }
  return 0;
}
/*
    4 4
    1 2 a
    3 2 a
    1 4 a
    3 4 b




*/


Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
//     #pragma GCC optimize("unroll-loops")
//     #pragma GCC optimize("Ofast")
//     #pragma GCC optimize("-O3")
//     #pragma GCC optimize("no-stack-protector")
//     #pragma GCC optimize("fast-math")
// #define LOCAL
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io                                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);                                                                 \\
  ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles                                                               \\
  ifstream cin("input.txt");                                                   \\
  ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll) x.size()
#define endl "\\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)

// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi = 3.14159265359;
ll inf = 1e18, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
ll binmult(ll a, ll b, ll mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R = 1e4;
const ll tx[4] = {0, 0, -1, 1};
const ll ty[4] = {-1, 1, 0, 0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int N = 1e5 + 1;
const int M = 1e9 + 7;
// typedef
// tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
// int n,m,k;
// int a[N],b[N];
int n;
int get_p(vector<int> &p, int v) {
  return (p[v] == v || p[v] == n || p[v] == n - 1 ? p[v]
                                                  : p[v] = get_p(p, p[v]));
}
signed main() {
  int t;
  cin >> t;
  while (t--) {
    //  int n;
    cin >> n;
    vector<int> a(n), b(n), c(n);
    vector<pii> ne, d, s;
    ll ans = 0;
    // need ->выгоднее их поставить туда // d-> невыгодно// вообще по
    for (int i = 0; i < n; i++) {
      cin >> a[i] >> b[i] >> c[i];
      --a[i];
      if (b[i] > c[i]) {
        ne.p_b({b[i] - c[i], a[i]});
        ans += c[i];
      } else if (b[i] <= c[i]) {
        d.p_b({c[i] - b[i], a[i]});
        ans += b[i];
      }
    }
    sort(rall(d));
    sort(rall(ne));
    vector<int> p(n + 2), cd(n);
    iota(all(p), 0);
    int l = 0;
    for (auto &z : ne) {
      int ps = get_p(p, z.s);
      if (ps == -1) {
        d.p_b({0, z.s});
        continue;
      }
      cd[ps] = z.f;
      p[ps] = ps - 1;
      l++;
      ans += z.f;
    }
    sort(rall(d));
    iota(all(p), 0);
    for (int i = 0; i < l; i++) {
      p[i] = l;
    }
    for (auto &z : d) {
      int ps = get_p(p, z.s + 1);
      if (ps == n) {
        continue;
      }
      cd[ps] = z.f;
      p[ps] = ps + 1;
      l++;
      ans += z.f;
    }
    cout << ans << endl;
  }
  return 0;
}
/*
    4 4
    1 2 a
    3 2 a
    1 4 a
    3 4 b




*/