Language: C++

#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <iomanip>
#include <unordered_map>
#include <stack>
#include <cstring>
#include <cctype>
#include <random>

using namespace std;
typedef long long  ll;
const ll INF = 1000000007;
const ll mod = 998244353;

ll f(vector<pair<ll, ll>> p) {
	int n = p.size();
	for (ll i = 0; i < n; i++)
	{
		p[i].first = min(p[i].first, n);
	}
	vector<vector<int>> s(n + 1);
	for (ll i = 0; i < n; i++)
	{
		s[p[i].first].push_back(p[i].second);
	}
	ll res = 0;
	priority_queue<int> q;
	for (int i = n; i >= 1; --i) {
		for (int x : s[i]) q.push(x);
		if (q.size() > 0) {
			res += q.top();
			q.pop();
		}
	}
	return res;
}

void solve() {
	ll n;
	cin >> n;
	vector<pair<ll, ll>> pl, pr;
	ll ans = 0;
	for (ll i = 0; i < n; i++)
	{
		ll k, l, r;
		cin >> k >> l >> r;
		ll ans = 0;
		ll m = min(l, r);
		ans += m;
		l -= m; r -= m;
		if (l > 0) pl.emplace_back(k, l);
		else pr.emplace_back(n - k, r);
	}
	ans += f(pl);
	ans += f(pr);
	cout << ans << endl;
}



int main() {
	int ts;
	cin >> ts;
	for (ll i = 0; i < ts; i++)
	{
		solve();
	}
	return 0;
}

Compiler output:
a.cc: In function 'll f(std::vector<std::pair<long long int, long long int> >)':
a.cc:23:33: error: no matching function for call to 'min(long long int&, int&)'
   23 |                 p[i].first = min(p[i].first, n);
      |                              ~~~^~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:23:33: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   23 |                 p[i].first = min(p[i].first, n);
      |                              ~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:2:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:23:33: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   23 |                 p[i].first = min(p[i].first, n);
      |                              ~~~^~~~~~~~~~~~~~~