text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
ll mn = 0;
vector<vector<pair<int, ll>>> x(2);
for (int i = 0; i < n; i++) {
ll k, l, r;
cin >> k >> l >> r;
mn += min(l, r);
if (l >= r) {
l -= r;
x[0].emplace_back(k, l);
} else {
r -= l;
if (n - k <= 0) {
continue;
}
x[1].emplace_back(n - k, r);
}
}
for (int id = 0; id < 2; id++) {
priority_queue<ll, vector<ll>, greater<ll>> pq;
sort(x[id].begin(), x[id].end());
x[id].emplace_back(2e9, 0);
for (int i = 0; i < x[id].size() - 1; i++) {
pq.emplace(x[id][i].second);
while (pq.size() > x[id][i].first) {
pq.pop();
}
}
while (!pq.empty()) {
mn += pq.top();
pq.pop();
}
}
cout << mn << '\n';
}
return 0;
} |
#include <stdio.h>
#include <set>
#include <vector>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int N = 2e5+5;
vector<pair<int,int> >lft,rgt;
long long Change(vector<pair<int,int> > a) {
int n = a.size();
long long res = 0;
set<int> pos;
for (int i = 1;i<= n;i++)
pos.insert(i);
for(auto x:a) {
auto it = pos.upper_bound(x.second);
if(it!=pos.begin()) {
it--;
res += x.first;
pos.erase(it);
}
}
return res;
}
void solve() {
int n;
scanf("%d",&n);
lft.clear();
rgt.clear();
int l,r,k;
long long ans = 0;
for (int i = 1;i<= n;i++) {
scanf("%d%d%d",&k,&l,&r);
if (l > r) ans += r,lft.push_back(make_pair(l-r,k));
else ans += l,rgt.push_back(make_pair(r-l,n-k));
}
sort(lft.begin(),lft.end());
reverse(lft.begin(),lft.end());
sort(rgt.begin(),rgt.end());
reverse(rgt.begin(),rgt.end());
printf("%lld\n",ans+Change(lft)+Change(rgt));
}
int main()
{
int cas;
scanf("%d",&cas);
while (cas--)
solve();
return 0;
}
/*
10110111001011011001110
6002382
*/ |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int T; cin >> T;
int inf = 1145141919;
while(T--){
int N; cin >> N;
long long ans = 0;
vector<pair<long long, int>> left, right;
for(int i = 0; i < N; i++){
int K; long long L, R;
cin >> K >> L >> R;
ans += min(L, R);
if(L >= R) left.emplace_back(L - R, K);
else right.emplace_back(R - L, N - K);
}
sort(left.begin(), left.end(), greater<pair<long long, int>>());
sort(right.begin(), right.end(), greater<pair<long long, int>>());
int a = left.size(); int b = N - a;
set<int> A, B;
for(int i = 1; i <= a; i++) A.insert(i);
for(int i = 1; i <= b; i++) B.insert(i);
A.insert(-inf); A.insert(inf);
B.insert(-inf); B.insert(inf);
for(auto p : left){
auto it = A.upper_bound(p.second);
it--;
if(*it == -inf) continue;
ans += p.first;
A.erase(it);
}
for(auto p : right){
auto it = B.upper_bound(p.second);
it--;
if(*it == -inf) continue;
ans += p.first;
B.erase(it);
}
cout << ans << "\n";
}
} |
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int MAXN = 2e5 + 7;
int k[MAXN], L[MAXN], R[MAXN];
ll solve(vector<pii>&vec) {
int n = vec.size();
set<int>s;
for (int i = 1; i <= n; i++) s.insert(i);
sort(vec.begin(), vec.end(), greater<pii>());
ll res = 0;
for (pii x : vec) {
auto it = s.upper_bound(x.second);
if (it == s.begin()) continue;
it--;
s.erase(it);
res += x.first;
}
return res;
}
int main() {
int T; scanf("%d", &T);
while (T--) {
int n; scanf("%d", &n);
long long ans = 0;
vector<pii>vec1, vec2;
for (int i = 1; i <= n; i++) {
scanf("%d%d%d", &k[i], &L[i], &R[i]);
if (L[i] >= R[i]) vec1.push_back({L[i] - R[i], k[i]}), ans += R[i];
else vec2.push_back({R[i] - L[i], n - k[i]}), ans += L[i];
}
ans += solve(vec1);
ans += solve(vec2);
printf("%lld\n", ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n;
int k[N], l[N], r[N];
int lft[N];
int getLft(int u) {
if (u == -1 || lft[u] == u) return u;
return lft[u] = getLft(lft[u]);
}
void add(int u) {
lft[getLft(u)] = getLft(getLft(u) - 1);
}
long long count(vector<pair<int, int>> camels, vector<int> k) {
sort(camels.begin(), camels.end(), greater<pair<int, int>>());
for (int i = 0; i < n; ++i) lft[i] = i;
long long tot = 0;
for (int i = 0; i < camels.size(); ++i) {
int idx = camels[i].second;
if (getLft(k[idx]) == -1) {
add(n-1);
} else {
add(k[idx]);
tot += camels[i].first;
}
}
return tot;
}
int solve() {
scanf("%d", &n);
vector<pair<int, int>> pos, neg;
vector<int> k1, k2;
long long tot = 0;
for (int i = 0; i < n; ++i) {
scanf("%d %d %d", &k[i], &l[i], &r[i]);
--k[i];
k1.push_back(k[i]);
k2.push_back(n - k[i] - 2);
if (l[i] >= r[i]) {
pos.emplace_back(l[i] - r[i], i);
tot += r[i];
} else {
neg.emplace_back(r[i] - l[i], i);
tot += l[i];
}
}
tot += count(pos, k1) + count(neg, k2);
printf("%lld\n", tot);
return 0;
}
int main() {
int t = 1;
scanf("%d", &t);
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
/*
3
2 93 78
1 71 59
3 57 96
15 15 0
12 0 0
0 0 0
T*Nは間に合わないか
1 2 3 4 5 6 7
2 1 1 0 0 0 2
え、T*NlogNって間に合うの？全然ダメそうに見えるんだけど
N
の総和は
2
×
10
5
を超えない
ほいきたーーーーー
やっぱ考え方あってたんや
あれ、WAとTLEだな・・・
箱の大きさ小さくしたらTLE消えたな、なんでだ。スタックオーバーフローするかな
そしてWAとれないなんだろう。何の漏れだろう
4
1 10 20
1 20 10
3 10 20
3 20 10
10 20 20 20
20 10 10 10
10 10 10 20
20 20 20 10
ああ、これ、
1
3
1 10 5
2 20 10
2 30 10
LL 0 1 2
1 2 0
55になるべき
やっぱり都度いれ都度だししないとだめか
*/
int main(){
ll T; cin>>T;
rep(j, T){
ll N,ans=0; cin>>N;
vector<vector<ll>> LL(N+10, vector<ll>(0,0)), RR(N+10, vector<ll>(0,0));
priority_queue<ll, vector<ll>, greater<ll>> LQ, RQ;
rep(i, N){
ll K,L,R; cin>>K>>L>>R;
if(L>R) LL[K-1].push_back(L-R);
else if(R>L && K<N) RR[K].push_back(R-L);
ans += min(R,L);
}
rep(i,N){
for(auto v: LL[i]) LQ.push(v);
while(LQ.size()>i+1) LQ.pop();
}
rep(i,N){
for(auto v: RR[N-1-i]) RQ.push(v);
while(RQ.size()>i+1) RQ.pop();
}
while(!LQ.empty()){
ans+=LQ.top();
LQ.pop();
}
while(!RQ.empty()){
ans+=RQ.top();
RQ.pop();
}
cout<<ans<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 2e5 + 5;
vector<pair<ll,ll>> a , b;
priority_queue<ll , vector<ll> , greater<ll>>Q;
int main()
{
ios::sync_with_stdio(false);
int t; cin >> t;
while (t--){
a.clear();
b.clear();
int n ; cin >> n;
ll ans = 0;
for (int i = 1 ; i <= n ; i++){
ll k , l , r; cin >> k >> l >> r;
if (k == n) ans += l;
else if (l > r) ans += r , a.push_back(make_pair(k , l - r));
else ans += l , b.push_back(make_pair(n - k , r - l));
}
sort(a.begin() , a.end());
sort(b.begin() , b.end());
for (auto & g : a){
// 排序之后不可能出现 Q.size() > g.k的情况吧
if (Q.size() < g.first) Q.push(g.second);
else if (Q.top() < g.second) Q.pop() , Q.push(g.second);
}
while (Q.size()) ans += Q.top() , Q.pop();
for (auto & g : b){
if (Q.size() < g.first) Q.push(g.second);
else if (Q.top() < g.second) Q.pop() , Q.push(g.second);
}
while (Q.size()) ans += Q.top() , Q.pop();
cout << ans << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
// const
// input
// valiable
// func
// main
void main2(){
ll ans = 0;
int n;cin >> n;
vector<pair<ll,ll>> left,right;
REP(i,n){
int k;
ll l,r;cin >> k >> l >> r;
ans += min(l,r);
if(l > r){
left.emplace_back(l - r,k - 1);
}else{
right.emplace_back(r - l,k - 1);
}
}
vector<vector<int>> lpos(n,vector<int>(0)),rpos(n,vector<int>(0));
REP(i,(int)left.size()){
lpos[left[i].second].push_back(i);
}
REP(i,(int)right.size()){
rpos[right[i].second].push_back(i);
}
priority_queue<ll,vector<ll>,greater<ll>> L,R;
for(int i = 0;i < n;i++){
for(int j : lpos[i]){
L.push(left[j].first);
}
while(L.size() > (i + 1)){
L.pop();
}
}
for(int i = n - 1;i >= 0;i--){
for(int j : rpos[i]){
R.push(right[j].first);
}
while(R.size() > (n - 1- i)){
R.pop();
}
}
while(L.size()){
ans += L.top();
L.pop();
}
while(R.size()){
ans += R.top();
R.pop();
}
cout << ans << '\n';
}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int t;cin >> t;
REP(_,t)main2();
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(){
int N;
cin >> N;
int64_t ans = 0;
vector<vector<pair<int, int>>> V(2);
for(int i=0; i<N; i++){
int k, l, r;
cin >> k >> l >> r;
if(l > r){
ans += r;
V[0].emplace_back(l-r, k-1);
}else{
ans += l;
V[1].emplace_back(r-l, N-k-1);
}
}
for(auto& A : V){
int sz = A.size();
set<int> st;
for(int i=0; i<sz; i++) st.insert(-i);
sort(A.rbegin(), A.rend());
for(auto& [v, i] : A){
auto it = st.lower_bound(-i);
if(it != st.end()){
ans += v;
st.erase(it);
}
}
}
cout << ans << endl;
}
int main(){
int T;
cin >> T;
while(T--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64=int_fast64_t;
void solve()
{
int n; cin>>n;
struct camel
{
int k;
int dif;
};
vector<camel> lft,rgt;
i64 ans=0;
for(int i=0; i<n; ++i)
{
int k,l,r; cin>>k>>l>>r;
if(l>r) lft.push_back({k-1,l-r}),ans+=r;
else rgt.push_back({k,r-l}),ans+=l;
}
int L=lft.size();
vector<vector<int>> lls(n);
for(auto c: lft)
{
lls[min(L-1,c.k)].push_back(c.dif);
}
priority_queue<int> ll;
for(int i=L-1; i>=0; i--)
{
for(int d: lls[i]) ll.emplace(d);
if(ll.empty()) continue;
ans+=ll.top();
ll.pop();
}
vector<vector<int>> rrs(n+1);
for(auto c: rgt)
{
rrs[max(L,c.k)].push_back(c.dif);
}
priority_queue<int> rr;
for(int i=L; i<n; i++)
{
for(int d: rrs[i]) rr.emplace(d);
if(rr.empty()) continue;
ans+=rr.top();
rr.pop();
}
cout << ans << "\n";
}
int main()
{
int T; cin>>T;
while(T--)
{
solve();
}
} |
#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#define N 200005
#define LL long long
using namespace std;
struct node
{
int k,len;
}p[N];
priority_queue<node>q;
bool operator<(node x,node y)
{
return x.len>y.len;
}
bool cmp(node x,node y)
{
return x.k<y.k;
}
int T,n,m;
int k[N],l[N],r[N];
int main()
{
int i,j;
scanf("%d",&T);
while(T--)
{
m=0;
LL ans=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&k[i],&l[i],&r[i]);
if(l[i]>=r[i])
{
ans+=r[i];
p[++m].k=k[i];
p[m].len=l[i]-r[i];
}
}
sort(p+1,p+m+1,cmp);
int size=0;
for(i=1;i<=m;i++)
{
q.push(p[i]);
size++;
if(size>p[i].k)
{
size--;
q.pop();
}
}
while(!q.empty())
{
ans+=q.top().len;
q.pop();
}
j=0;
for(i=1;i<=n;i++)
{
if(l[i]<r[i])
{
ans+=l[i];
p[++j].len=r[i]-l[i];
p[j].k=n-k[i];
}
}
sort(p+1,p+j+1,cmp);
size=0;
for(i=1;i<=j;i++)
{
q.push(p[i]);
size++;
if(size>p[i].k)
{
size--;
q.pop();
}
}
while(!q.empty())
{
ans+=q.top().len;
q.pop();
}
printf("%lld\n",ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i,n) for(ll i=0; i<n; ++i)
#define print(a) cout << (a) << endl
ll solve(vector<P> v) {
ll n=v.size(),ret=0;
rep(i,n) v[i].first=min(v[i].first,n);
vector<lvector> w(n+1);
rep(i,n) w[v[i].first].emplace_back(v[i].second);
lpque q;
for(ll i=n;i>0;--i) {
for(ll j:w[i]) q.push(j);
if(q.size()) {ret+=q.top();q.pop();}
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll T,n,k,l,r,m,ans;cin>>T;
rep(t,T) {
cin>>n;ans=0;
vector<P> A,B;
rep(i,n) {
cin>>k>>l>>r;
m=min(l,r);ans+=m;
l-=m,r-=m;
if(l>0) A.emplace_back(k,l);else B.emplace_back(n-k,r);
}
ans+=solve(A);ans+=solve(B);
print(ans);
}
return 0;
} |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define F first
#define S second
#define ll long long
#define mp make_pair
using namespace std;
const int N=2e5+5;
ll ans;int n,T;vector<pii>L,R;
int l[N],r[N],k[N];pii p[N];
priority_queue<int,vector<int>,greater<int> >q;
ll cal(vector<pii>v)
{
while(!q.empty())q.pop();
ll res=0;
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
{
res+=v[i].S;
q.push(v[i].S);
while(q.size()>v[i].F)res-=q.top(),q.pop();
}
return res;
}
int main()
{
cin>>T;
while(T--)
{
while(!q.empty())q.pop();
ans=0;L.clear();
cin>>n;R.clear();
for(int i=0;i<n;i++)
{
cin>>k[i]>>l[i]>>r[i];
ans+=min(l[i],r[i]);
if(l[i]>r[i])
L.push_back(mp(k[i],l[i]-r[i]));
if(r[i]>l[i])
R.push_back(mp(n-k[i],r[i]-l[i]));
}
cout<<ans+cal(L)+cal(R)<<"\n";
}
return 0;
} |
#include <iostream>
#include <vector>
#include <queue>
void solve () {
int n;
std::cin >> n;
std::vector<int> k(n), l(n), r(n), a, b;
for (int i = 0; i < n; i++) {
std::cin >> k[i] >> l[i] >> r[i];
}
long long ans = 0;
std::vector<int> index[2];
for (int i = 0; i < n; i++) {
ans += std::min(l[i], r[i]);
if (l[i] >= r[i]) {
index[0].push_back(i);
} else {
index[1].push_back(i);
std::swap(l[i], r[i]);
k[i] = n - k[i];
}
}
auto calc = [&] (const std::vector<int> &v) -> void {
std::vector<int> idx[n + 1];
for (int i : v) idx[k[i]].push_back(i);
std::priority_queue<int, std::vector<int>, std::greater<int>> que;
for (int j = 0; j < n + 1; j++) {
for (int i : idx[j]) que.push(l[i] - r[i]);
while (que.size() > j) que.pop();
}
while (not que.empty()) {
ans += que.top();
que.pop();
}
};
for (int i = 0; i < 2; i++) calc(index[i]);
std::cout << ans << '\n';
return;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t;
std::cin >> t;
while (t--) solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
vector <int> a[N], b[N];
void solve() {
int n; cin >> n;
for(int i = 1; i <= n; i++) {
a[i].clear();
b[i].clear();
}
long long ans = 0;
for(int i = 1; i <= n; i++) {
int k, l, r; cin >> k >> l >> r;
ans += min(l, r); int x = min(l, r); l -= x; r -= x;
if(l) {
a[k].push_back(l);
}
if(r) {
b[k + 1].push_back(r);
}
}
priority_queue <int> pq;
for(int i = 1; i <= n; i++) {
while(b[i].size()) {
pq.push(b[i].back()); b[i].pop_back();
}
if(pq.size()) {
ans += pq.top(); pq.pop();
}
}
while(pq.size()) {
pq.pop();
}
for(int i = n; i >= 1; i--) {
while(a[i].size()) {
pq.push(a[i].back()); a[i].pop_back();
}
if(pq.size()) {
ans += pq.top(); pq.pop();
}
}
cout << ans << endl;
}
int main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int test, tc = 0; cin >> test;
while(test--) {
solve();
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
ll solve(ll N, vector<pair<ll, ll>> &A){
sort(A.begin(), A.end());
priority_queue<ll, vector<ll>, greater<ll>> pq;
ll ret = 0;
for(auto x : A){
ll k = x.first;
ll v = x.second;
ret += v;
pq.push(v);
if(pq.size() > k){
ret -= pq.top();
pq.pop();
}
}
return ret;
}
int main(){
ll T;
cin >> T;
rep(t, T){
ll N;
cin >> N;
ll tot = 0;
vector<pair<ll, ll>> A;
vector<pair<ll, ll>> B;
rep(i, N){
ll K, L, R;
cin >> K >> L >> R;
if(L > R){
A.emplace_back(K, L-R);
tot += R;
}else{
B.emplace_back(N-K, R-L);
tot += L;
}
}
cout << tot + solve(N, A) + solve(N, B) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define maxn 200000
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef double db;
int n;
int k[maxn+5],l[maxn+5],r[maxn+5];
ll solve(vector<pii> A)
{
ll res=0;
sort(A.begin(),A.end());
int ptr=A.size()-1;
priority_queue<int> q;
per(i,1,n)
{
while(ptr>=0 && A[ptr].FI==i) q.push(A[ptr--].SE);
if(q.size())
{
res+=q.top();
q.pop();
}
}
return res;
}
int main()
{
int CAS; scanf("%d",&CAS);
while(CAS--)
{
scanf("%d",&n);
rep(i,1,n) scanf("%d%d%d",&k[i],&l[i],&r[i]);
ll ans=0;
rep(i,1,n) if(l[i]>=r[i]) ans+=r[i]; else ans+=l[i];
vector<pii> A,B;
rep(i,1,n) if(l[i]>=r[i]) A.pb({k[i],l[i]-r[i]}); else B.pb({n-k[i],r[i]-l[i]});
ans+=solve(A);
ans+=solve(B);
printf("%lld\n",ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int n, a[202020], b[202020], k[202020];
bool used[202020], used2[202020];
P p[202020];
void solve(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> k[i] >> a[i] >> b[i];
k[i]--;
p[i] = P(abs(b[i]-a[i]), i);
}
sort(p, p+n, greater<P>());
fill(used,used+n,0);
fill(used2,used2+n,0);
int l = 0, r = n-1;
i64 cnt = 0;
for(int i = 0; i < n; i++){
int j = p[i].second;
if(a[j] > b[j]){
if(l > k[j]) cnt += b[j];
else{
cnt += a[j];
int pos = k[j];
while(used[pos]) pos--;
used[pos] = 1;
while(used[l]) l++;
}
}
else{
if(r <= k[j]) cnt += a[j];
else{
cnt += b[j];
int pos = k[j]+1;
while(used2[pos]) pos++;
used2[pos] = 1;
while(used2[r]) r--;
}
}
}
cout << cnt << endl;
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
cin >> t;
while(t--){
solve();
}
return 0;
} |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
int main () {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
ll answer = 0;
vector <pair <ll, ll>> a(n);
for (int i = 0; i < n; i++) {
ll K, L, R;
cin >> K >> L >> R;
answer += R;
a[i].first = K;
a[i].second = L - R;
}
sort(a.begin(), a.end());
multiset <ll> values;
vector <ll> pre(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
if (a[i].second < 0) {
pre[i] = sum;
continue;
}
values.insert(a[i].second);
sum += a[i].second;
while (values.size() > a[i].first) {
ll x = *values.begin();
sum -= x;
values.erase(values.begin());
}
pre[i] = sum;
}
vector <ll> suf(n);
sum = 0;
while (!values.empty())
values.erase(values.begin());
for (int i = n - 1; i >= 0; i--) {
if (a[i].second >= 0) {
suf[i] = sum;
continue;
}
values.insert(a[i].second);
while (values.size() > n - a[i].first) {
ll x = *values.rbegin();
sum += x;
values.erase(values.find(x));
}
suf[i] = sum;
}
cout << answer + suf[0] + pre[n - 1] << '\n';
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#define N 200005
#define LL long long
using namespace std;
struct node
{
int k,len;
}p[N];
priority_queue<node>q;
bool operator<(node x,node y)
{
return x.len>y.len;
}
bool cmp(node x,node y)
{
return x.k<y.k;
}
int T,n;
int k[N],l[N],r[N];
int main()
{
int i,j;
scanf("%d",&T);
while(T--)
{
j=0;
LL ans=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&k[i],&l[i],&r[i]);
if(l[i]>=r[i])
{
ans+=r[i];
p[++j].k=k[i];
p[j].len=l[i]-r[i];
}
}
sort(p+1,p+j+1,cmp);
int size=0;
for(i=1;i<=j;i++)
{
q.push(p[i]);
size++;
if(size>p[i].k)
{
size--;
q.pop();
}
}
while(!q.empty())
{
ans+=q.top().len;
q.pop();
}
j=0;
for(i=1;i<=n;i++)
{
if(l[i]<r[i])
{
ans+=l[i];
p[++j].len=r[i]-l[i];
p[j].k=n-k[i];
}
}
sort(p+1,p+j+1,cmp);
size=0;
for(i=1;i<=j;i++)
{
q.push(p[i]);
size++;
if(size>p[i].k)
{
size--;
q.pop();
}
}
while(!q.empty())
{
ans+=q.top().len;
q.pop();
}
printf("%lld\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int T;
cin>>T;
for(int _=0;_<T;_++){
int N;
cin>>N;
vector<long long> K(N),L(N),R(N);
for(int i=0;i<N;i++)cin>>K[i]>>L[i]>>R[i];
vector<pair<long long,long long>> l,r;
long long ans = 0LL;
for(int i=0;i<N;i++){
if(L[i]>R[i]){
ans += R[i];
l.emplace_back(K[i]-1,L[i]-R[i]);
}
else{
ans += L[i];
r.emplace_back(N-K[i]-1,R[i]-L[i]);
}
}
sort(l.begin(),l.end());
sort(r.begin(),r.end());
priority_queue<long long,vector<long long>,greater<long long>> Q;
for(int i=0;i<l.size();i++){
if(Q.size()<=l[i].first){
ans += l[i].second;
Q.push(l[i].second);
}
else{
if(Q.size()==0)continue;
if(Q.top()<l[i].second){
ans -= Q.top();
Q.pop();
ans += l[i].second;
Q.push(l[i].second);
}
}
}
while(Q.size()!=0)Q.pop();
for(int i=0;i<r.size();i++){
if((int)Q.size()<=r[i].first){
ans += r[i].second;
Q.push(r[i].second);
}
else{
if(Q.size()==0)continue;
if(Q.top()<r[i].second){
ans -= Q.top();
Q.pop();
ans += r[i].second;
Q.push(r[i].second);
}
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
for (int n_case = 1; n_case <= T; ++n_case) {
int n;
cin >> n;
long long total = 0;
vector<pair<int, int>> left;
vector<pair<int, int>> right;
for (int i = 0; i < n; ++i) {
int k, l, r;
cin >> k >> l >> r;
if (l > r) {
left.emplace_back(k, l - r);
total += r;
} else if (r > l) {
right.emplace_back(n - k, r - l);
total += l;
} else {
total += l;
}
}
sort(left.begin(), left.end());
sort(right.begin(), right.end());
function<void(const vector<pair<int, int>>&)> process = [&](const vector<pair<int, int>>& a) {
multiset<int> vals;
for (auto p: a) {
vals.insert(p.second);
if (vals.size() > p.first)
vals.erase(vals.begin());
}
for (int v: vals)
total += v;
};
process(left);
process(right);
cout << total << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
ll solve() {
int n;
cin>>n;
vector<int> l(n),r(n);
vector<vector<int>> evL(n+10), evR(n+10);
ll res = 0;
for (int i=0; i<n; i++) {
int k;
cin>>k>>l[i]>>r[i];
if (l[i]>=r[i]) {
evL[k].push_back(i);
} else {
evR[k+1].push_back(i);
}
res += min(l[i],r[i]);
}
// left
{
priority_queue<ll,vector<ll>,greater<ll>> pq;
for (int i=1; i<=n; i++) {
for (int j: evL[i]) {
pq.push(l[j]-r[j]);
res += (l[j]-r[j]);
}
while ((int)pq.size() > i) {
res -= pq.top();
pq.pop();
}
}
}
// right
{
priority_queue<ll,vector<ll>,greater<ll>> pq;
for (int i=n; i>=1; i--) {
for (int j: evR[i]) {
pq.push(r[j]-l[j]);
res += (r[j]-l[j]);
}
while ((int)pq.size() > n-i+1) {
res -= pq.top();
pq.pop();
}
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t; cin>>t;
while (t--) {
cout<<solve()<<"\n";
}
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end
void solve(){
int n; cin>>n;
vector<int> a(n),l(n),r(n);
vector<vector<int>> lb(n),rb(n);
ll res=0;
rep(i,0,n){
cin>>a[i]>>l[i]>>r[i]; a[i]--;
res+=min(l[i],r[i]);
if(l[i]<r[i]){if(a[i]+1<n)rb[a[i]+1].push_back(r[i]-l[i]);}
else lb[a[i]].push_back(l[i]-r[i]);
}
priority_queue<int> pq;
for(int i=n-1;i>=0;i--){
for(int x:lb[i])pq.push(x);
if(!pq.empty()){
res+=pq.top(); pq.pop();
}
}
while(pq.size())pq.pop();
for(int i=0;i<n;i++){
for(int x:rb[i])pq.push(x);
if(!pq.empty()){
res+=pq.top(); pq.pop();
}
}
cout<<res<<endl;
}
int main(){
int t; cin>>t;
while(t--)solve();
return 0;
} |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii; typedef vector<ll> VL; const int MD = 1e9 + 7;
void dbg(){cerr<<"\n";} template <class F,class ...S> void dbg(const F& f, const S&...s){cerr <<f <<": "; dbg(s...);}
ll cal(vector<pii>& v){
ll rtn =0;
priority_queue<int> pq;
int m = sz(v);
vector<VI> kh(m+2);
for(auto x: v) kh[min(x.first, m)].push_back(x.second);
repr(i, m, 1) {
for(auto w: kh[i]) pq.emplace(w);
if(sz(pq)){
rtn += pq.top();
pq.pop();
}
}
return rtn;
}
void solove(){
int n; cin >>n;
vector<pii> lf, rg;
ll ans = 0;
rep(i, n){
int k, l, r;
cin >>k >>l >>r;
if(l >r){
lf.emplace_back(k, l-r);
}else if(l < r){
rg.emplace_back(n-k, r-l);
}
ans += min(l, r);
}
ans += cal(lf) + cal(rg);
cout << ans <<"\n";
}
int main()
{
cin.tie(0); ios_base::sync_with_stdio(false);
int t;
cin >>t;
rep(_g, t) solove();
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define mod 998244353
#define vi vector <ll>
using namespace std ;
ll power(ll x,ll y,ll m)
{ //power(x,y)=x^y %m;
ll res=1%m;
while(y)
{
if(y&1)
res=(res*x)%m;
x=(x*x)%m;
y=(y>>1)%m;
}
return res;
}
ll mod_inverse(ll x,ll m)
{
return power(x,m-2,m);
}
ll n;
ll func(vector<pair<ll,ll> > pp)
{
sort(pp.rbegin(),pp.rend());
set<ll> st;
ll res=0;
for (ll i = 0; i < n; i++) {
st.insert(i);
}
for (ll i=0;i<(ll)pp.size();i++)
{
auto it = st.lower_bound(pp[i].second);
if (it == st.begin())
{
continue;
}
--it;
st.erase(it);
res += pp[i].first;
}
return res;
}
int main ()
{
ios_base :: sync_with_stdio ( false );
cin.tie( NULL );
cout.tie( NULL );
ll t = 1 ;
cin>>t;
while ( t--)
{
//ll n;
cin>>n;
ll ans=0;
vector<pair<ll,ll> >v;
vector<pair<ll,ll> >v1;
for(ll i=0;i<n;i++)
{
ll k,l,r;
cin>>k>>l>>r;
if(l>r)
{ans+=r;
v.pb(mp(l-r,k));
}
else
{ans+=l;
v1.pb(mp(r-l,n-k));
}
}
ans+=func(v);
ans+=func(v1);
cout<<ans<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define SZ(a) ((int)(a).size())
#define PB push_back
#define MP make_pair
const int maxn = 200009;
const int MOD = 1e9 + 7;
int main(){
#ifdef LOCAL
freopen("a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false),cout.tie(0),cin.tie(0);
int T;cin>>T;
while(T--){
int n;
int64_t res=0;
cin>>n;
vector<pair<int,int>> A,B;
for(int i=1;i<=n;++i){
int k,l,r;
cin>>k>>l>>r;
if(l<r)B.emplace_back(n-k,r-l);
else A.emplace_back(k,l-r);
res+=min(l,r);
}
auto cal=[&](vector<pair<int,int>> &C){
sort(C.rbegin(),C.rend());
priority_queue<int> Q;
for(int i=n,j=0;i>=1;--i){
while(j<SZ(C)&&C[j].first==i)Q.push(C[j++].second);
if(SZ(Q)){
res+=Q.top();
Q.pop();
}
}
};
cal(A);
cal(B);
cout<<res<<'\n';
}
return 0;
}
//2020.07.13 13:06:12
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main()
{
int T;
cin >> T;
rep(i,T)
{
ll N;
cin >> N;
ll ans = 0;
vector<pair<ll,P> > l,r;
rep(j,N)
{
ll K,L,R;
cin >> K >> L >> R;
K--;
if (L >= R)
{
l.push_back(make_pair(K,P(L,R)));
ans += R;
}
else
{
if (K != N-1) r.push_back(make_pair(K,P(L,R)));
ans += L;
}
}
//cout << ans << " ";
priority_queue<ll, vector<ll>, greater<ll> > Q1,Q2;
sort(l.begin(), l.end());
sort(r.begin(), r.end());
reverse(r.begin(), r.end());
int idx = 0;
rep(j,N)
{
while(idx < l.size() && l[idx].first == j)
{
Q1.push(l[idx].second.first - l[idx].second.second);
idx++;
}
while(Q1.size() > j+1)
{
Q1.pop();
}
}
while(!Q1.empty())
{
ans += Q1.top();
Q1.pop();
}
//cout << ans << " ";
idx = 0;
rep(j,N)
{
while(idx < r.size() && r[idx].first == N-2-j)
{
Q2.push(r[idx].second.second - r[idx].second.first);
idx++;
}
while(Q2.size() > j+1)
{
Q2.pop();
}
}
while(!Q2.empty())
{
ans += Q2.top();
Q2.pop();
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
constexpr llong mod = 1e9+7;
constexpr llong inf = mod * mod;
int main() {
llong T;
cin >> T;
while (T--) {
llong N;
vector<vector<lpair>> l, r;
cin >> N;
l.resize(N + 1);
r.resize(N + 1);
for (int i = 0; i < N; i++) {
llong K, L, R;
cin >> K >> L >> R;
if (K < N && L < R) {
r[K].push_back(lpair(L, R));
}
else {
l[K].push_back(lpair(L, R));
}
}
llong ans = 0;
priority_queue<llong> left, right;
for (int i = 1; i <= N; i++) {
for (auto vv: l[i]) {
ans += vv.first;
left.push(vv.second - vv.first);
}
while (left.size() > i) {
ans += left.top();
left.pop();
}
}
for (int i = N - 1; i >= 1; i--) {
for (auto vv: r[i]) {
ans += vv.second;
right.push(vv.first - vv.second);
}
while (right.size() > N - i) {
ans += right.top();
right.pop();
}
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
typedef tuple<LL, LL, LL> P;
LL solve() {
int N; cin >> N;
LL ans = 0;
map<int, vector<LL>> ml, mr;
for (int i = 0; i < N; ++i) {
LL K, L, R; cin >> K >> L >> R;
if (L >= R) {
ans += R;
ml[K].push_back(L - R);
} else {
ans += L;
mr[K].push_back(R - L);
}
}
priority_queue<LL, vector<LL>, greater<LL>> quel, quer;
for (int i = 1; i <= N; ++i) {
for (LL v : ml[i]) {
quel.push(v);
}
while (quel.size() > i) quel.pop();
for (LL v : mr[N - i]) {
quer.push(v);
}
while (quer.size() > i) quer.pop();
}
while (!quel.empty()) {
ans += quel.top(); quel.pop();
}
while (!quer.empty()) {
ans += quer.top(); quer.pop();
}
return ans;
}
int main() {
int T; cin >> T;
for (int i = 0; i < T; ++i) {
cout << solve() << endl;
}
}
|
#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((int)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 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;
} |
// In the name of God //
#include <bits/stdc++.h>
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pii pair <int, int>
using namespace std;
const ll mod = 998244353;
ll calc(vector<pii> &a) {
int n = a.size();
set<int> free;
ll ans = 0;
sort(rall(a));
for (int i = 1; i <= n; i++) free.insert(i);
for (auto p : a) {
auto it = free.upper_bound(p.second);
if(it != free.begin()) {
ans += p.first;
--it;
free.erase(it);
}
}
return ans;
}
void solve() {
int n;
cin >> n;
vector<pair<int, int>> pos, neg;
ll ans = 0;
for (int i = 0; i < n; i++) {
int k, l ,r;
cin >> k >> l >> r;
if(l > r) {
ans += r;
pos.push_back({l - r, k});
}
else {
ans += l;
neg.push_back({r - l, n - k});
}
}
cout << ans + calc(pos) + calc(neg) << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt;
cin >> tt;
for (int tc = 1; tc <= tt; ++tc) {
solve();
}
} |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,ll> P;
int n;
int k[200005],l[200005],r[200005];
void solve(){
scanf("%d",&n);
ll ans=0;
vector<P> vf,vb;
for(int i=0;i<n;i++){
scanf("%d%d%d",&k[i],&l[i],&r[i]);
k[i]--;
ans+=min(l[i],r[i]);
if(l[i]>=r[i]){
vf.push_back(P(k[i],l[i]-r[i]));
}else{
vb.push_back(P(k[i],r[i]-l[i]));
}
}
sort(vf.begin(),vf.end());
priority_queue<ll,vector<ll>,greater<ll> > que;
int cur=0;
int cnt=0;
for(int i=0;i<n;i++){
while(cur<vf.size() && vf[cur].first==i){
que.push(vf[cur].second);
cnt++;
if(cnt>i+1){
que.pop();
cnt--;
}
cur++;
}
}
while(que.size()){
ans+=que.top();
que.pop();
}
sort(vb.begin(),vb.end());
reverse(vb.begin(),vb.end());
cur=0;
cnt=0;
for(int i=n;i>=0;i--){
while(cur<vb.size() && vb[cur].first==(i-1)){
que.push(vb[cur].second);
cnt++;
if(cnt>(n-i)){
que.pop();
cnt--;
}
cur++;
}
}
while(que.size()){
ans+=que.top();
que.pop();
}
printf("%lld\n",ans);
}
int main(void){
int t;
scanf("%d",&t);
for(int i=0;i<t;i++){
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=200009;
int Tn;
int n;
int K[maxn],L[maxn],R[maxn];
vector<int>G[maxn];
priority_queue<int>q;
int main(){
scanf("%d",&Tn);
while(Tn--){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d%d%d",&K[i],&L[i],&R[i]);
long long ans=0;
for(int i=1;i<=n;++i)if(L[i]==R[i])ans+=L[i];
int p=0;
while(!q.empty())q.pop();
for(int i=1;i<=n;++i)G[i].clear();
for(int i=1;i<=n;++i){
if(L[i]>R[i]){
++p;G[K[i]].push_back(L[i]-R[i]);ans+=R[i];
}
}
for(int i=p+1;i<=n;++i){
for(int j=0;j<G[i].size();++j){
int x=G[i][j];
q.push(x);
}
}
for(int i=p;i>=1;--i){
for(int j=0;j<G[i].size();++j){
int x=G[i][j];
q.push(x);
}
if(!q.empty()){
ans+=q.top();q.pop();
}
}
p=0;
while(!q.empty())q.pop();
for(int i=1;i<=n;++i)G[i].clear();
for(int i=1;i<=n;++i){
if(L[i]<R[i]){
++p;G[K[i]+1].push_back(R[i]-L[i]);ans+=L[i];
}
}
for(int i=1;i<n-p+1;++i){
for(int j=0;j<G[i].size();++j){
int x=G[i][j];
q.push(x);
}
}
for(int i=n-p+1;i<=n;++i){
for(int j=0;j<G[i].size();++j){
int x=G[i][j];
q.push(x);
}
if(!q.empty()){
ans+=q.top();q.pop();
}
}
printf("%lld\n",ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
#define x first
#define y second
int N;
void exe(int tc) {
lint ans = 0;
vector<pint> a, b;
cin >> N;
for (int i=0; i<N; i++) {
int k, l, r;
cin >> k >> l >> r;
if (l > r) {
ans += r;
a.emplace_back(k, l-r);
} else {
ans += l;
b.emplace_back(N-k, r-l);
}
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
priority_queue<int, vector<int>, greater<int> > qa, qb;
for (pint p : a) {
qa.push(p.y);
ans += p.y;
while (qa.size() > p.x) {
ans -= qa.top();
qa.pop();
}
}
for (pint p : b) {
qb.push(p.y);
ans += p.y;
while (qb.size() > p.x) {
ans -= qb.top();
qb.pop();
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int tc;
cin >> tc;
for (int i=1; i<=tc; i++) exe(i);
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int T; cin >> T;
while(T>0){
int N; cin >> N;
vector<vector<int>> fr(N+1);
vector<vector<int>> bc(N+1);
ll ans = 0;
REP(i,N){
int k,l,r; cin >> k >> l >> r;
ans += min(l,r);
if(l-r>0) fr[k].push_back(l-r);
else bc[N-k].push_back(r-l);
}
priority_queue<int, vector<int>, greater<int>> q_fr;
priority_queue<int, vector<int>, greater<int>> q_bc;
FOR(i,1,N+1){
for(auto j: fr[i]) q_fr.push(j);
while(q_fr.size()>i) q_fr.pop();
for(auto j: bc[i]) q_bc.push(j);
while(q_bc.size()>i) q_bc.pop();
}
while(!q_fr.empty()){
ans += q_fr.top(); q_fr.pop();
}
while(!q_bc.empty()){
ans += q_bc.top(); q_bc.pop();
}
cout << ans << endl;
T--;
}
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cassert>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr ll INF = 3000000000000000000;
void solve() {
int n;
cin >> n;
vector<ll> k(n), l(n), r(n);
vector<vector<int>> S(n);
REP(i, n) {
cin >> k[i] >> l[i] >> r[i];
--k[i];
S[k[i]].push_back(i);
}
ll ans = 0;
REP(i, n) ans += min(l[i], r[i]);
priority_queue<ll> pq;
for (int i = n - 1; i >= 0; --i) {
for (int j: S[i]) {
if (l[j] > r[j]) pq.push(l[j] - r[j]);
}
if (!pq.empty()) {
ans += pq.top();
pq.pop();
}
}
while (!pq.empty()) pq.pop();
for (int i = 1; i < n; ++i) {
for (int j: S[i - 1]) {
if (l[j] <= r[j]) pq.push(r[j] - l[j]);
}
if (!pq.empty()) {
ans += pq.top();
pq.pop();
}
}
cout << ans << "\n";
}
int main() {
int t;
cin >> t;
REP(i, t) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n;
vector<pair<int, int> > a, b;
int l, r, k;
long long ans;
std::priority_queue<int, vector<int>, greater<int> > q;
int main(){
scanf("%d", &t);
while(t--){
scanf("%d", &n);
a.clear(), b.clear(), ans = 0;
for(int i = 1;i <= n;i++){
scanf("%d%d%d", &k, &l, &r);
if(l > r){
ans += r;
a.push_back({k, l - r});
}else if(l < r && n - k){
ans += l;
b.push_back({n - k, r - l});
}else{
ans += l;
}
}
sort(a.begin(), a.end());
for(int i = 0;i < a.size();i++){
if(q.size() < a[i].first){
q.push(a[i].second);
}else{
if(q.top() < a[i].second){
q.pop();
q.push(a[i].second);
}
}
}
while(!q.empty()) ans += q.top(), q.pop();
swap(a, b);
sort(a.begin(), a.end());
for(int i = 0;i < a.size();i++){
if(q.size() < a[i].first){
q.push(a[i].second);
}else{
if(q.top() < a[i].second){
q.pop();
q.push(a[i].second);
}
}
}
while(!q.empty()) ans += q.top(), q.pop();
printf("%lld\n", ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
const int N = 2e5 +5;
int dp[N],n;
int pow(int a,int n,int mod) {
int y= 1;
for (;n;n/=2) {
if (n&1) y = (ll)y*a%mod;
a = (ll)a*a%mod;
}
return y;
}
void solve() {
cin >> n;
ll ans = 0;
vector<pii> v[2];
for (int i = 0,pos,l,r; i <n; i++) {
cin >> pos >> l >> r;
ans += min(l,r);
if (l >= r) v[0].pb({l-r,pos});
else v[1].pb({r-l,pos});
}
sort(v[0].begin(),v[0].end(),[&](pii a,pii b) {
if (a.fi != b.fi) return a > b;
else return a.se < b.se;
});
sort(v[1].begin(),v[1].end(),[&](pii a,pii b) {
if (a.fi != b.fi) return a > b;
else return a.se > b.se;
});
set<int> s;
for (int i = 1; i <= n; i++) s.insert(i);
for (auto i : v[0]) {
int val = i.fi, pos = i.se;
auto it = s.upper_bound(pos);
if (it == s.begin()) continue;
it--;
s.erase(it);
ans += i.fi;
}
s.clear();
for (int i = 1; i <= n; i++) s.insert(i);
for (auto i : v[1]) {
int val = i.fi, pos = i.se;
auto it = s.upper_bound(pos);
if (it == s.end()) continue;
s.erase(it);
ans += i.fi;
}
cout << ans<<'\n';
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
} |
#include<bits/stdc++.h>
#define MAXN 200005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int t,n,l[MAXN],r[MAXN],k[MAXN];
vector<pair<int,int> > v1,v2;
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
v1.clear(); v2.clear();
ll ans=0;
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&k[i],&l[i],&r[i]);
if(l[i]>=r[i])
{
ans+=r[i];
v1.push_back(P(k[i],l[i]-r[i]));
}
else
{
ans+=l[i];
v2.push_back(P(n-k[i],r[i]-l[i]));
}
}
sort(v1.begin(),v1.end()); sort(v2.begin(),v2.end());
priority_queue<int,vector<int>,greater<int> > pque;
for(auto p:v1)
{
pque.push(p.S);
while(pque.size()>p.F)
pque.pop();
}
while(pque.size()) {ans+=pque.top(); pque.pop();}
for(auto p:v2)
{
pque.push(p.S);
while(pque.size()>p.F)
pque.pop();
}
while(pque.size()) {ans+=pque.top(); pque.pop();}
printf("%lld\n",ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main(){
int t; cin >> t;
while(t--){
int n; cin >> n;
vector<P> ls(0), rs(0);
int k, l, r; ll ans=0;
REP(i,n){
cin >> k >> l >> r;
ans+=max(l,r);
if(l>r)
ls.push_back({k,abs(l-r)});
else
rs.push_back({n-k,abs(l-r)});
}
sort(ALL(ls));
sort(ALL(rs));
multiset<int> sel;
REP(i,ls.size()){
if(ls[i].first<=sel.size()){
if(*sel.begin()<ls[i].second){
ans-=*sel.begin();
sel.erase(sel.begin());
sel.insert(ls[i].second);
}
else{
ans-=ls[i].second;
}
}
else{
sel.insert(ls[i].second);
}
}
multiset<int> ser;
REP(i,rs.size()){
if(rs[i].first<=ser.size()){
if(rs[i].first==0){
ans-=rs[i].second;
continue;
}
if(*ser.begin()<rs[i].second){
ans-=*ser.begin();
ser.erase(ser.begin());
ser.insert(rs[i].second);
}
else{
ans-=rs[i].second;
}
}
else{
ser.insert(rs[i].second);
}
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
signed main(){
int t;cin>>t;
while(t--){
int n;cin>>n;
int ans=0;
set<int> s,t;
for(int i=0;i<=n+1;i++){
s.insert(i);
t.insert(i);
}
vector<P> L,R;
for(int i=0;i<n;i++){
int k,l,r;cin>>k>>l>>r;
if(l>r){
ans+=r;
L.push_back(P(l-r,k));
}
else{
ans+=l;
R.push_back(P(r-l,k));
}
}
sort(L.rbegin(),L.rend());
sort(R.rbegin(),R.rend());
for(P p:L){
int a=*--s.upper_bound(p.second);
if(a>=1){
s.erase(a);
ans+=p.first;
}
}
for(P p:R){
int a=*t.upper_bound(p.second);
if(a<=n){
t.erase(a);
ans+=p.first;
}
}
cout<<ans<<endl;
}
}
|
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
vector<int> in[200200];
int k[200200], l[200200], r[200200];
int main()
{
int Test; scanf ("%d", &Test); while (Test--){
int n, x = 0; scanf ("%d", &n);
long long base = 0;
for (int i = 0; i < n; i++){
scanf ("%d %d %d", &k[i], &l[i], &r[i]);
if (l[i] >= r[i]) x++;
}
for (int i = 0; i < n; i++){
if (l[i] >= r[i]){
base += r[i];
if (k[i] > x) k[i] = x;
in[k[i]].push_back(l[i] - r[i]);
}
else{
if (k[i] <= x){
base += r[i];
continue;
}
in[k[i] + 1].push_back(r[i] - l[i]);
base += l[i];
}
}
priority_queue<int> Q;
for (int i = x; i >= 1; i--){
for (auto &v : in[i]) Q.push(v);
if (!Q.empty()) base += Q.top(), Q.pop();
in[i].clear();
}
while (!Q.empty()) Q.pop();
for (int i = x + 1; i <= n; i++){
for (auto &v : in[i]) Q.push(v);
if (!Q.empty()) base += Q.top(), Q.pop();
in[i].clear();
}
in[n + 1].clear();
printf ("%lld\n", base);
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#define w first
#define k second
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int N=200010;
pii a[N],b[N];
int p[N];
int find(int x)
{
if(p[x]!=x) p[x]=find(p[x]);
return p[x];
}
int main()
{
int T;
cin>>T;
while(T--)
{
int n,cnta=0,cntb=0;
cin>>n;
ll res=0;
for(int i=1;i<=n;i++) p[i]=i;
for(int i=0;i<n;i++)
{
int k,l,r;
cin>>k>>l>>r;
if((k==0&&l>=r)||(k==n&&r>l))
{
res+=min(l,r);
continue;
}
if(l>=r) res+=r,a[cnta++]={l-r,k};
else res+=l,b[cntb++]={r-l,n-k};
}
sort(a,a+cnta),sort(b,b+cntb);
reverse(a,a+cnta),reverse(b,b+cntb);
for(int i=0;i<cnta;i++)
{
int pos=find(a[i].k);
if(pos) p[pos]=pos-1,res+=a[i].w;
}
for(int i=1;i<=n;i++) p[i]=i;
for(int i=0;i<cntb;i++)
{
int pos=find(b[i].k);
if(pos) p[pos]=pos-1,res+=b[i].w;
}
cout<<res<<endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
using ull = unsigned long long;
ll solve(vector<pair<int,int>> v){
int n=v.size();
for(int i=0;i<n;i++){
v[i].first=min(v[i].first,n);
}
vector<vector<int>> s(n+1);
for(int i=0;i<n;i++){
s[v[i].first].push_back(v[i].second);
}
ll res=0;
priority_queue<ll> q;
for(int i=n;i>=1;i--){
for(int x:s[i]){q.push(x);}
if(q.size()){
res+=q.top();
q.pop();
}
}
return res;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int q; cin >> q;
while(q--){
int n; cin >> n;
vector<pair<int,int>> pl,pr;
ll res=0;
for(int i=0;i<n;i++){
int k,l,r; cin >> k >> l >> r;
int m=min(l,r);
res+=m;
l-=m,r-=m;
if(l>0)pl.push_back({k,l});
else pr.push_back({n-k,r});
}
res+=solve(pl);
res+=solve(pr);
printf("%lld\n",res );
}
} |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
using namespace std;
using P = pair<int, int>;
ll f(vector<P> p)
{
int n = p.size();
rep(i, n) p[i].first = min(p[i].first, n);
vector<vector<int>> s(n + 1);
rep(i, n) 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()
{
int n;
cin >> n;
vector<P> pl, pr;
ll ans = 0;
rep(i, n)
{
int k, l, r;
cin >> k >> l >> r;
int 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(void)
{
int ts;
cin >> ts;
rep(ti, ts) solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
typedef tuple<int,int,int> TP;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
ll res = 0;
vector<vector<int>> left(n), right(n);
rep(i,n) {
int x, l, r;
cin >> x >> l >> r;
x--;
res += min(l, r);
if (l - r < 0) right[x].emplace_back(r - l);
else left[x].emplace_back(l - r);
}
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; i++) {
for (auto v : left[i]) pq.push(v);
while (pq.size() > (i + 1)) {
pq.pop();
}
}
while (!pq.empty()) res += pq.top(), pq.pop();
for (int i = n - 1; i >= 0; i--) {
for (auto v : right[i]) pq.push(v);
while (pq.size() > (n - i - 1)) {
pq.pop();
}
}
while (!pq.empty()) res += pq.top(), pq.pop();
cout << res << "\n";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<int,int>> vL;
vector<pair<int,int>> vR;
int t;
int n;
set<int> sL;
set<int> sR;
#define fi first
#define se second
int main(){
cin>>t;
while(t--){
ll ans = 0;
cin>>n;
vL.clear();
vR.clear();
for(int i=0;i<n;i++){
int k,l,r;
cin>>k>>l>>r;
if(l<r) vR.push_back({l-r,k});
else vL.push_back({l-r,k});
ans += r;
}
for(int i=1;i<=vL.size();i++) sL.insert(i);
for(int i=vL.size()+1;i<=n;i++) sR.insert(i);
sort(vL.begin(),vL.end(),greater<pair<int,int>>());
sort(vR.begin(),vR.end());
for(auto i:vL){
auto tmp = sL.upper_bound(i.se);
if(tmp == sL.begin()){
sL.erase(--sL.end());
}else{
ans += i.fi;
sL.erase(--tmp);
}
}
for(auto i:vR){
auto tmp = sR.upper_bound(i.se);
if(tmp == sR.end()) {
sR.erase(sR.begin());
ans += i.fi;
}
else{
sR.erase(tmp);
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
void solve() {
int n;
cin >> n;
ll ans = 0;
vector<ll> lefters[n], righters[n+1];
rep(i, n) {
ll k, l, r;
cin >> k >> l >> r;
k--;
ans += min(l, r);
if (l > r) {
lefters[k].push_back(l - r);
} else {
righters[k+1].push_back(r - l);
}
}
priority_queue<ll, vector<ll>, greater<ll>> pql, pqr;
rep(i, n) {
for (ll val : lefters[i]) pql.push(val);
while ((ll)pql.size() > i + 1) pql.pop();
for (ll val : righters[n - i - 1]) pqr.push(val);
while ((ll)pqr.size() > i + 1) pqr.pop();
}
while (!pql.empty()) {
ans += pql.top();
pql.pop();
}
while (!pqr.empty()) {
ans += pqr.top();
pqr.pop();
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solveSingleSide(vector<pair<int, ll>> yeeters) {
int n = yeeters.size();
for (auto &p_v : yeeters) p_v.first = min(n, p_v.first);
vector<vector<ll>> byIntroDate(n);
for (auto p_v : yeeters) {
if (p_v.first == 0) continue;
else byIntroDate[p_v.first - 1].push_back(p_v.second);
}
ll value = 0;
multiset<ll> possible;
for (int pl = n - 1; pl >= 0; --pl) {
for (ll k : byIntroDate[pl]) possible.insert(k);
if (!possible.empty()) {
ll toTake = *possible.rbegin();
possible.erase(possible.find(toTake));
value += toTake;
}
}
return value;
}
ll solve() {
int n; scanf("%d", &n);
vector<ll> cutoff(n), kaliwa(n), kanan(n);
for (int i = 0; i < n; ++i) scanf("%lld %lld %lld", &cutoff[i], &kaliwa[i], &kanan[i]);
vector<pair<int, ll>> leftBias, rightBias;
ll ans = 0;
for (int i = 0; i < n; ++i) {
ans += min(kaliwa[i], kanan[i]);
if (kaliwa[i] > kanan[i]) {
leftBias.emplace_back(cutoff[i], kaliwa[i] - kanan[i]);
} else {
rightBias.emplace_back(n - cutoff[i], kanan[i] - kaliwa[i]);
}
}
return ans + solveSingleSide(leftBias) + solveSingleSide(rightBias);
}
int main() {
int t; scanf("%d", &t);
while (t--) printf("%lld\n", solve());
return 0;
}
|
#include <bits/stdc++.h>
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#define pb push_back
#define ALL(s) s.begin(),s.end()
#define FIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define SZ(s) int(s.size())
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const int MAXN=200010;
vector<ll> v[MAXN],v2[MAXN];
int main(){FIN;
int t; cin>>t;
while(t--){
ll n,ans=0; cin>>n;
fore(i,0,n+1) v[i].clear(),v2[i].clear();
fore(i,0,n){
int k,l,r; cin>>k>>l>>r;
if(l-r>0) ans+=r,v[k-1].pb(l-r);
else ans+=l,v2[k].pb(r-l);
}
multiset<ll> did;
fore(i,0,n){
for(auto x:v[i]){
if(SZ(did)<i+1) did.insert(x);
else if(*did.begin()<x) did.erase(did.begin()),did.insert(x);
}
}
for(auto x:did) ans+=x;
did.clear();
for(int i=n-1;i>=0;i--){
for(auto x:v2[i]){
if(SZ(did)<(n-i)) did.insert(x);
else if(*did.begin()<x) did.erase(did.begin()),did.insert(x);
}
}
for(auto x:did) ans+=x;
cout<<ans<<"\n";
}
} |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P &p) const {
return g > p.g;
}
int k, g;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
ll s = 0;
vector<P> p[2];
for (int i = 0; i < n; i++) {
int k, l, r;
cin >> k >> l >> r;
s += min(l, r);
int g = l - r;
p[g < 0].push_back({ g < 0 ? n - k : k, abs(g) });
}
for (int h = 0; h < 2; h++) {
sort(p[h].begin(), p[h].end());
int m = p[h].size();
set<int> st;
for (int i = 0; i < m; i++) {
st.insert(i);
}
for (int i = 0; i < m; i++) {
auto it = st.lower_bound(p[h][i].k);
if (it == st.begin()) continue;
st.erase(--it);
s += p[h][i].g;
}
}
cout << s << '\n';
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using P = pair<int,int>;
using ll = long long;
P lp[200005], rp[200005];
int q, n, k, l, r, le, re;
int main(){
scanf("%d", &q);
rep(i,q){
scanf("%d", &n);
ll ans = le = re = 0;
priority_queue<int> lqu, rqu;
rep(i,n){
scanf("%d%d%d", &k, &l, &r);
(l < r ? rp[re++] : lp[le++]) = P{k,abs(l-r)};
ans += min(l,r);
}
sort(lp, lp+le, greater<P>());
sort(rp, rp+re);
for(int i=le, le2=0; i>0; i--){
while(le2 < le && lp[le2].first >= i) lqu.push(lp[le2++].second);
if(!lqu.empty()){
ans += lqu.top();
lqu.pop();
}
}
for(int i=le, re2=0; i<n; i++){
while(re2 < re && rp[re2].first <= i) rqu.push(rp[re2++].second);
if(!rqu.empty()){
ans += rqu.top();
rqu.pop();
}
}
printf("%lld\n", ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
lint ans = 0;
vector<vector<int>> left(n), right(n);
for (int i = 0; i < n; i++) {
int k, l, r;
cin >> k >> l >> r;
k--;
ans += min(l, r);
if (l - r > 0) {
left[k].push_back(l - r);
} else if (l - r < 0 && k + 1 < n) {
right[k + 1].push_back(r - l);
}
}
auto Calc = [&](int piv) {
lint res = 0;
priority_queue<int> pq;
for (int i = 0; i < n; i++) {
for (auto j : right[i]) {
pq.push(j);
}
if (piv <= i && !pq.empty()) {
res += pq.top();
pq.pop();
}
}
while (!pq.empty()) pq.pop();
for (int i = n - 1; i >= 0; i--) {
for (auto j : left[i]) {
pq.push(j);
}
if (i < piv && !pq.empty()) {
res += pq.top();
pq.pop();
}
}
return res;
};
int lo = 0, hi = n;
while (lo < hi) {
int md = (lo + hi) / 2;
if (Calc(md) > Calc(md + 1)) {
hi = md;
} else {
lo = md + 1;
}
}
cout << ans + Calc(lo) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define ip pair<ll,ll>
#define ff first
#define ss second
#define MAX 100005
const ll MOD = 1000000007;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int t;
cin>>t;
while(t--){
ll n;
cin>>n;
ll k[n],l[n],r[n];
vector<ip> vl,vr;
ll ans = 0;
for(int i=0;i<n;i++){
cin>>k[i]>>l[i]>>r[i];
--k[i];
ans += l[i];
if(k[i] == n-1)
continue;
if(l[i]<r[i])
vr.pb({r[i]-l[i],k[i]});
else if(l[i]>r[i]){
vl.pb({l[i]-r[i],k[i]});
ans += r[i]-l[i];
}
}
sort(vl.begin(),vl.end());
set<int>::iterator it;
set<int> s;
for(int i=0;i<n;i++)
s.insert(i);
for(int i=vl.size()-1;i>=0;i--){
it = s.upper_bound(vl[i].ss);
if(it == s.begin())
continue;
--it;
s.erase(it);
ans += vl[i].ff;
}
sort(vr.begin(),vr.end());
s.clear();
for(int i=0;i<n;i++)
s.insert(i);
for(int i=vr.size()-1;i>=0;i--){
it = s.lower_bound(vr[i].ss+1);
if(it == s.end())
continue;
s.erase(it);
ans += vr[i].ff;
}
cout<<ans<<endl;
}
}
|
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int t, n, k, a, b;
vector<int> vec[2][200009];
long long ans;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
ans = 0;
for (int i = 1; i <= n; i++) {
vec[0][i].clear();
vec[1][i].clear();
}
for (int i = 1; i <= n; i++) {
cin >> k >> a >> b;
if (a < b) {
vec[1][k + 1].pb(b - a);
}
else if (a > b) {
vec[0][k].pb(a - b);
}
ans += min(a, b);
}
int cnt = 0;
multiset<int> w;
for (int i = n; i > 0; i--) {
//cnt++;
//sort(vec[0][i].begin(), vec[0][i].end());
//reverse(vec[0][i].begin(), vec[0][i].end());
int sz = vec[0][i].size();
for (int j = 0; j < sz; j++) {
w.insert(vec[0][i][j]);
}
if (w.empty()) continue;
auto p = w.end();
p--;
ans += *p;
w.erase(p);
}
w.clear();
for (int i = 0; i <= n; i++) {
int sz = vec[1][i].size();
for (int j = 0; j < sz; j++) {
w.insert(vec[1][i][j]);
}
if (w.empty()) continue;
auto p = w.end();
p--;
ans += *p;
w.erase(p);
}
cout << ans << E;
}
//system("pause");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int l[n],r[n],k[n];
map<int,vector<int> > mp,mp1;
long long ans=0;
for(int i=0;i<n;i++)
{
cin>>k[i]>>l[i]>>r[i];
ans+=min(r[i],l[i]);
if(l[i]>=r[i])
mp[k[i]].push_back(i);
else
mp1[n-k[i]].push_back(i);
}
multiset<int> inserted;
for(int j=1;j<=n;j++)
{
for(auto ele:mp[j])
{
inserted.insert(l[ele]-r[ele]);
ans+=l[ele]-r[ele];
}
while(inserted.size()>j)
{
ans-=*inserted.begin();
inserted.erase(inserted.begin());
}
}
inserted.clear();
for(int j=1;j<=n;j++)
{
for(auto ele:mp1[j])
{
inserted.insert(r[ele]-l[ele]);
ans+=r[ele]-l[ele];
}
while(inserted.size()>j)
{
ans-=*inserted.begin();
inserted.erase(inserted.begin());
}
}
cout<<ans<<endl;
}
return 0;
} |
#include <iostream>
#include <queue>
#include <vector>
#include <utility>
using namespace std;
long long f(vector<pair<int,int>> a){
priority_queue<int> que;
int size=a.size();
vector<vector<int>> in(size+1);
for(auto p: a){
if(p.first>=size){
que.push(p.second);
}else{
in[p.first].emplace_back(p.second);
}
}
long long res=0;
for(int i=size-1;i>=0;i--){
if(!que.empty()){
res+=que.top();
que.pop();
}
for(auto p:in[i]){
que.push(p);
}
}
return res;
}
int main(){
int T;
cin>>T;
long long ans;
for(int i=0;i<T;i++){
int N;
cin>>N;
int k,l,r;
vector<pair<int,int>> front;
vector<pair<int,int>> end;
ans=0;
for(int i=0;i<N;i++){
cin>>k>>l>>r;
if(k==N){
ans+=l;
}else if(l>r){
ans+=r;
front.emplace_back(k,l-r);
}else{
ans+=l;
end.emplace_back(N-k,r-l);
}
}
ans+=f(front);
ans+=f(end);
cout<<ans<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 2e5 + 5;
vector<pair<ll,ll>> a , b;
priority_queue<ll , vector<ll> , greater<ll>>Q;
int main()
{
ios::sync_with_stdio(false);
int t; cin >> t;
while (t--){
a.clear();
b.clear();
int n ; cin >> n;
ll ans = 0;
for (int i = 1 ; i <= n ; i++){
ll k , l , r; cin >> k >> l >> r;
if (l > r || k == n) ans += r , a.push_back(make_pair(k , l - r));
else ans += l , b.push_back(make_pair(n - k , r - l));
}
sort(a.begin() , a.end());
sort(b.begin() , b.end());
for (auto & g : a){
// 排序之后不可能出现 Q.size() > g.k的情况吧
if (Q.size() < g.first) Q.push(g.second);
else if (Q.top() < g.second) Q.pop() , Q.push(g.second);
}
while (Q.size()) ans += Q.top() , Q.pop();
for (auto & g : b){
if (Q.size() < g.first) Q.push(g.second);
else if (Q.top() < g.second) Q.pop() , Q.push(g.second);
}
while (Q.size()) ans += Q.top() , Q.pop();
cout << ans << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
//解説写し
long long f(vector<pair<int,int>>p){
int n=p.size();
for(int i=0;i<n;i++){
p[i].first=min(p[i].first,n);
}
vector<vector<int>>s(n+1);
for(int i=0;i<n;i++){
s[p[i].first].push_back(p[i].second);
}
long long 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(){
int n;
cin>>n;
vector<pair<int,int>>pl,pr;
long long ans=0;
for(int i=0;i<n;i++){
int k,l,r;
cin>>k>>l>>r;
int 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(int ti=0;ti<ts;ti++){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 200222, inf = 1000111222;
int t, n;
long long solve(vector<pair<int, int>> &v) {
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
long long res = 0;
set<int> q;
for (int i = 0; i < n; ++i) {
q.insert(i);
}
for (auto p : v) {
auto it = q.lower_bound(p.second);
if (it == q.begin()) {
continue;
}
--it;
q.erase(it);
res += p.first;
}
return res;
}
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
long long ans = 0;
vector<pair<int, int>> a, b;
for (int i = 0; i < n; ++i) {
int k, l, r;
scanf("%d%d%d", &k, &l, &r);
ans += min(l, r);
if (l > r) {
a.push_back({l - r, k});
} else {
b.push_back({r - l, n - k});
}
}
ans += solve(a);
ans += solve(b);
printf("%lld\n", ans);
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P &p) const {
return g > p.g;
}
int k, g;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
ll s = 0;
vector<P> p[2];
for (int i = 0; i < n; i++) {
int k, l, r;
cin >> k >> l >> r;
s += min(l, r);
int g = l - r;
p[g < 0].push_back({ g < 0 ? n - k : k, abs(g) });
}
for (int h = 0; h < 2; h++) {
sort(p[h].begin(), p[h].end());
int m = p[h].size();
set<int> st;
for (int i = 0; i < m; i++) {
st.insert(st.end(), i);
}
for (int i = 0; i < m; i++) {
auto it = st.lower_bound(p[h][i].k);
if (it == st.begin()) continue;
st.erase(--it);
s += p[h][i].g;
}
}
cout << s << '\n';
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr ll mod998=998244353;
struct A{
int k,l,r;
};
bool operator<(const A &a,const A &b){
return a.l-a.r<b.l-b.r;
}
int T,N;
A S[200000];
ll tourist(){
ll res=0;
vector<A>p,q;
for(int i=0;i<N;i++){
if(S[i].l-S[i].r>=0)p.push_back(S[i]);
else q.push_back(S[i]);
}
sort(p.begin(),p.end());
sort(q.begin(),q.end());
set<int>st;
for(int i=0;i<p.size();i++){
st.insert(i);
}
for(int i=p.size()-1;i>=0;i--){
auto it=st.upper_bound(p[i].k);
if(it==st.begin()){
res+=p[i].r;
}
else{
res+=p[i].l;
it--;
st.erase(it);
}
}
st.clear();
for(int i=p.size();i<N;i++){
st.insert(i);
}
for(int i=0;i<q.size();i++){
auto it=st.upper_bound(q[i].k);
if(it==st.end()){
res+=q[i].l;
}
else{
res+=q[i].r;
st.erase(it);
}
}
return res;
}
int main(){
cin>>T;
for(int i=0;i<T;i++){
cin>>N;
for(int j=0;j<N;j++){
cin>>S[j].k>>S[j].l>>S[j].r;
S[j].k--;
}
cout<<tourist()<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
#define fast() ios::sync_with_stdio(false), cin.tie(nullptr)
#define digit(N) cout << fixed << setprecision((N))
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
ll cost(vector<pair<int, ll>> v)
{
int N = v.size();
for (auto &p : v) // N より大きい必要がない
p.first = min(p.first, N);
sort(v.rbegin(), v.rend());
priority_queue<int> pq;
ll res = 0;
for (int i = N, j = 0; i > 0; i--)
{
while (j < N && v[j].first == i) // 配置できるものを pq に入れる
{
pq.push(v[j].second);
j++;
}
if (pq.empty())
continue;
res += pq.top();
pq.pop();
}
return res;
}
int main()
{
int t;
cin >> t;
while (t--)
{
int N;
cin >> N;
vector<pair<int, ll>> left, right;
ll ans = 0;
for (int i = 0; i < N; i++)
{
ll k, l, r, m;
cin >> k >> l >> r;
ans += min(l, r);
ll d = max(l, r) - min(l, r);
if (l > r)
left.emplace_back(k, d);
if (r > l)
right.emplace_back(N - k, d);
}
ans += cost(left);
ans += cost(right);
cout << ans << "\n";
}
} |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
long long calc(std::vector<std::pair<int, int>> &in)
{
long long r = 0;
std::priority_queue<int> q;
int index = in.size() - 1;
for (int i = in.size(); i > 0; i -= 1)
{
while (index >= 0 && in[index].first >= i)
{
q.emplace(in[index].second);
--index;
}
if (q.size() > 0)
{
r += (long long)q.top();
q.pop();
}
}
return r;
}
int main()
{
int t;
scanf("%d", &t);
while (t-- > 0)
{
int n;
scanf("%d", &n);
std::vector<std::pair<int, int>> a;
std::vector<std::pair<int, int>> b;
long long ans = 0;
for (int i = 0; i < n; ++i)
{
int k, l, r;
scanf("%d%d%d", &k, &l, &r);
if (l > r)
{
ans += (long long)r;
a.emplace_back(k, l - r);
}
else if (l < r)
{
ans += (long long)l;
if (n != k)
{
b.emplace_back(n - k, r - l);
}
}
else
{
ans += (long long)r;
}
}
std::sort(a.begin(), a.end());
std::sort(b.begin(), b.end());
ans += calc(a) + calc(b);
printf("%lld\n", ans);
}
return 0;
}
|
#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cstdlib>
#include<bitset>
using namespace std;
typedef long long ll;
struct node{
ll k,v;
};
bool cmp(node a1,node a2)
{
return a1.k<a2.k;
}
ll n;
int main(void)
{
ll t;
scanf("%lld",&t);
while(t--)
{
scanf("%lld",&n);
ll ans=0;
vector<node> l,r;
for(ll i=0;i<n;i++)
{
ll k,l1,r1;
scanf("%lld%lld%lld",&k,&l1,&r1);
if(l1==r1||k==n) ans+=l1;
else if(l1>r1)
{
ans+=r1;
l.push_back((node){k,l1-r1});
}
else
{
ans+=l1;
r.push_back((node){n-k,r1-l1});
}
}
sort(l.begin(),l.end(),cmp);
sort(r.begin(),r.end(),cmp);
priority_queue<ll , vector<ll>, greater<ll> > pq;
for(ll i=0;i<l.size();i++)
{
if(l[i].k>pq.size())
{
pq.push(l[i].v);
}
else
{
if(pq.top()<l[i].v)
{
pq.pop();
pq.push(l[i].v);
}
}
}
while(pq.size()) ans+=pq.top(),pq.pop();
for(ll i=0;i<r.size();i++)
{
if(r[i].k>pq.size())
{
pq.push(r[i].v);
}
else
{
if(pq.top()<r[i].v)
{
pq.pop();
pq.push(r[i].v);
}
}
}
while(pq.size()) ans+=pq.top(),pq.pop();
printf("%lld\n",ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
long long solve(const vector<pair<int, int> > &F) {
long long ret = 0;
priority_queue<int, vector<int>, greater<int> > pq;
for (auto p : F) {
pq.push(p.second);
ret += p.second;
if (pq.size() > p.first) {
ret -= pq.top();
pq.pop();
}
}
return ret;
}
void run_case() {
int n;
cin >> n;
vector<pair<int, int> > F, S;
long long ans = 0;
int k, l, r;
for (int i = 0; i < n; i++) {
cin >> k >> l >> r;
ans += min(l, r);
if (l >= r) {
if (l == r)continue;
F.push_back({k, l - r});
} else {
if (k == n)continue;
S.push_back({n - k, r - l});
}
}
sort(F.begin(), F.end());
sort(S.begin(), S.end());
cout << ans + solve(F) + solve(S) << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)run_case();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
ll f(vector<P> p){
int n = p.size();
rep(i, n) p[i].first = min(p[i].first, n);
vector<vector<int>> s(n+1);
rep(i, n) 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(){
int n;
cin >> n;
vector<P> pl, pr;
ll ans = 0;
rep(i, n){
int k, l, r;
cin >> k >> l >> r;
int m = min(l, r);
l -= m; r -= m;
ans += 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;
rep(ti, ts) solve();
return 0;
} |
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 500010
using namespace std;
ll n,k[N],l[N],r[N],ans;
vector<pair<ll,ll> > lf,rg;
priority_queue<ll> pq;
int main(){
ll T,tp,i;
scanf("%lld",&T);
while(T--)
{
scanf("%lld%",&n);
lf.clear();
rg.clear();
ans=0;
for(i=0;i<n;i++)
{
scanf("%lld%lld%lld",&k[i],&l[i],&r[i]);
k[i]--;
if(r[i]>=l[i])
{
rg.push_back(make_pair(k[i],l[i]-r[i]));
ans+=r[i];
}
else
{
lf.push_back(make_pair(k[i],r[i]-l[i]));
ans+=l[i];
}
}
sort(lf.begin(),lf.end());
sort(rg.begin(),rg.end());
reverse(rg.begin(),rg.end());
tp=0;
while(!pq.empty())
{
pq.pop();
}
for(i=0;i<lf.size();i++)
{
pq.push(lf[i].S);
if(tp>lf[i].F)
{
ans+=pq.top();
pq.pop();
}
else
{
tp++;
}
}
tp=n-1;
while(!pq.empty())
{
pq.pop();
}
for(i=0;i<rg.size();i++)
{
pq.push(rg[i].S);
if(tp<=rg[i].F)
{
ans+=pq.top();
pq.pop();
}
else
{
tp--;
}
}
printf("%lld\n",ans);
}
return 0;
} |
#include<bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pb push_back
#define ii pair<int,int>
#define iii pair<ii,int>
#define ppb pop_back
#define st first
#define nd second
#define ll long long
#define N 200005
#define inf 2000000005
#define MOD 1000000007
#define LOG 40
#define EPS 0.000000001
using namespace std;
int n;
int k[N], l[N], r[N], nxt[N];
int find(int x) {
if(x == -1 or x == n or nxt[x] == x)
return x;
return nxt[x] = find(nxt[x]);
}
void solve() {
cin >> n;
ll ans = 0;
vector<int> ind;
for(int i = 0; i < n; i++) {
cin >> k[i] >> l[i] >> r[i];
ans += r[i];
ind.pb(i);
}
sort(ind.begin(), ind.end(), [&](int i, int j) {
return l[i] - r[i] > l[j] - r[j];
});
for(int i = 0; i < n; i++)
nxt[i] = i;
int L_cnt = 0;
for(int i: ind) {
if(l[i] - r[i] <= 0)
break ;
int L = find(k[i] - 1);
if(L != -1) {
ans += l[i] - r[i];
nxt[L] = L - 1;
r[i] = -1;
L_cnt++;
}
}
for(int i = 0; i < L_cnt; i++)
nxt[i] = L_cnt;
for(int i = L_cnt; i < n; i++)
nxt[i] = i;
reverse(ind.begin(), ind.end());
for(int i: ind) {
if(r[i] == -1)
continue ;
int R = find(k[i]);
if(R != n) {
nxt[R] = R + 1;
}
else {
ans += l[i] - r[i];
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t;
cin >> t;
while(t--)
solve();
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+7;
struct node{int v,k;}a[N],b[N];
int n,na,nb;
ll ans;
bool operator<(node a,node b){return a.k<b.k;}
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
int T;scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
ans=0,na=0,nb=0;
for(int i=1;i<=n;i++)
{
int k,l,r;scanf("%d%d%d",&k,&l,&r);
if(l>r)ans+=r,a[++na]=(node){l-r,k};
else ans+=l,b[++nb]=(node){r-l,n-k};
}
sort(a+1,a+na+1),sort(b+1,b+nb+1);
for(int i=1;i<=na;i++)
if(a[i].k)
{
if(q.size()<a[i].k)q.push(a[i].v);
else if(q.size()==a[i].k&&a[i].v>q.top())q.pop(),q.push(a[i].v);
}
while(!q.empty())ans+=q.top(),q.pop();
for(int i=1;i<=nb;i++)
if(b[i].k)
{
if(q.size()<b[i].k)q.push(b[i].v);
else if(q.size()==b[i].k&&b[i].v>q.top())q.pop(),q.push(b[i].v);
}
while(!q.empty())ans+=q.top(),q.pop();
printf("%lld\n",ans);
}
} |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()
void solve() {
int N;
cin >> N;
vector<int> diff1[N + 1], diff2[N + 2];
ll ans = 0;
REP(i, N) {
int K, L, R;
cin >> K >> L >> R;
if (L >= R) diff1[K].push_back(L - R);
else diff2[K + 1].push_back(R - L);
ans += min(L, R);
}
priority_queue<int, vector<int>, greater<int>> que;
FOR(i, 1, N + 1) {
for (int d : diff1[i]) que.push(d);
while (que.size() > i) que.pop();
}
while (!que.empty()) {
ans += que.top(); que.pop();
}
FOR(i, 1, N + 1) {
for (int d : diff2[N + 1 - i]) que.push(d);
while (que.size() > i) que.pop();
}
while (!que.empty()) {
ans += que.top(); que.pop();
}
cout << ans << endl;
}
int main() {
int T;
cin >> T;
REP(i, T) solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main(){
int t,n;
ll k,l,r,b;
pair<ll,ll> a;
cin>>t;
for(int i=0;i<t;i++){
cin>>n;
ll ans=0;
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> lq;
priority_queue<pair<ll,ll>> rq;
for(int j=0;j<n;j++){
cin>>k>>l>>r;
ans+=min(l,r);
if(l>=r)lq.push({k,l-r});
else rq.push({k,r-l});
}
priority_queue<ll,vector<ll>,greater<ll>> la,ra;
ll lac=0,rac=0;
for(int j=1;j<=n;j++){
if(lq.empty())break;
a=lq.top();
while(a.first==j){
lq.pop();
la.push(a.second);
lac++;
ans+=a.second;
if(lq.empty())break;
else a=lq.top();
}
while(lac>j){
b=la.top();
la.pop();
ans-=b;
lac--;
}
}
for(int j=n;j>=1;j--){
if(rq.empty())break;
a=rq.top();
while(a.first==j){
rq.pop();
ra.push(a.second);
rac++;
ans+=a.second;
if(rq.empty())break;
else a=rq.top();
}
while(rac>n-j){
b=ra.top();
ra.pop();
ans-=b;
rac--;
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define MOD 1000000007
#define fast ios_base::sync_with_stdio(false)
#define itt cin.tie(0)
#define now cout.tie(0)
#define N 200010
using namespace std;
ll T,n,l[N],k[N],r[N],ans;
vector<pair<pair<ll,ll>,ll> > vv,bk;
int main(){
fast;itt;now;
ll i;
cin>>T;
while(T--)
{
cin>>n;
ans=0;
vv.clear();
bk.clear();
for(i=0;i<n;i++)
{
cin>>k[i]>>l[i]>>r[i];
if(l[i]>=r[i])
{
vv.push_back(make_pair(make_pair(k[i],l[i]-r[i]),i));
}
else
{
bk.push_back(make_pair(make_pair(k[i],r[i]-l[i]),i));
}
}
sort(vv.begin(),vv.end());
sort(bk.begin(),bk.end());
reverse(bk.begin(),bk.end());
priority_queue<ll> pq;
for(i=0;i<vv.size();i++)
{
ans+=l[vv[i].S];
pq.push(-vv[i].F.S);
if(pq.size()>vv[i].F.F)
{
ans+=pq.top();
pq.pop();
}
}
while(!pq.empty()) pq.pop();
for(i=0;i<bk.size();i++)
{
ans+=r[bk[i].S];
pq.push(-bk[i].F.S);
if(n-pq.size()+1<=bk[i].F.F)
{
ans+=pq.top();
pq.pop();
}
}
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_range(i, s, e) for (int i = (s); i < (int)(e); i++)
#define rep_rev(i, s, e) for (int i = (s)-1; i >= (int)(e); i--)
#define sort_vec(v) sort((v).begin(),(v).end())
typedef int64_t lint;
// lint mod = 998244353;
// lint mod = 1000000007;
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void app() {
int t;
cin>>t;
rep(_t,t){
int n;
cin>>n;
lint ans=0;
vector<multiset<lint>> cp(n+1),cm(n+1);
rep(i,n){
int k;
lint l,r;
cin>>k>>l>>r;
if(l>r) cp[k].emplace(l-r),ans+=r;
else cm[k].emplace(r-l),ans+=l;
}
priority_queue<lint,vector<lint>,greater<lint>> sp,sm;
rep(k,n+1){
for(lint c:cp[k]){
ans+=c; sp.push(c);
if(sp.size()>k){
ans-=sp.top(); sp.pop();
}
}
}
rep_rev(k,n+1,0){
for(lint c:cm[k]){
ans+=c; sm.push(c);
if(sm.size()>n-k){
ans-=sm.top(); sm.pop();
}
}
}
cout<<ans<<endl;
}
}
int main(){app();return 0;}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int N;
cin >> N;
int64_t res = 0;
vector<vector<pair<int, int>>> K(N);
for (int i = 0; i < N; i++) {
int k, l, r;
cin >> k >> l >> r;
k--;
K[k].emplace_back(make_pair(l, r));
res += min(l, r);
}
priority_queue<int, vector<int>, greater<int>> que;
for (int k = 0; k < N; k++) {
for (auto& [l, r] : K[k]) {
if (l > r) {
que.push(l - r);
}
}
while ((int)que.size() > k + 1) {
que.pop();
}
}
while (!que.empty()) {
res += que.top();
que.pop();
}
for (int k = N - 1; k > -1; k--) {
for (auto& [l, r] : K[k]) {
if (r > l) {
que.push(r - l);
}
}
while ((int)que.size() > N - k - 1) {
que.pop();
}
}
while (!que.empty()) {
res += que.top();
que.pop();
}
cout << res << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
for (int i = 0; i < T; i++) {
solve();
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#define k first
#define v second
using namespace std;
const int N = 200005;
int n, T;
long long score(vector<pair<int, int>> &x)
{ if(x.empty()) return 0;
long long res = 0;
sort(x.begin(), x.end());
priority_queue<int> q;
int idx = x.size() - 1;
for(int i = x[idx].k; i; --i)
{
while(idx >= 0 && x[idx].k == i) q.push(x[idx--].v);
if(!q.empty())
{
res += q.top();
q.pop();
}
}
return res;
}
int main(){
cin >> T;
while(T--)
{
cin >> n;
long long ans = 0;
vector<pair<int, int>> L, R;
for(int i = 0, k, l, r; i < n; ++i)
{
scanf("%d %d %d", &k, &l, &r);
if(l <= r) {
ans += l;
R.push_back({n-k, r-l});
}
else
{
ans += r;
L.push_back({k, l-r});
}
}
ans += score(L);
ans += score(R);
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll T;
vector<ll> ans;
cin >> T;
for(int t=0;t<T;t++){
ll N;
cin >> N;
ll tmp_ans = 0;
vector<vector<ll>> v_right(N);
vector<vector<ll>> v_left(N);
for(int n=0;n<N;n++){
ll k,l,r;
cin >> k >> l >> r;
if(l>r) v_left[k-1].push_back(l-r);
else v_right[k-1].push_back(r-l);
tmp_ans += min(l,r);
}
priority_queue<ll,vector<ll>,greater<ll>> pq;
for(int i=0;i<N;i++){
for(auto &e : v_left[i]){
pq.push(e);
}
while(pq.size() > i+1) pq.pop();
}
while(!pq.empty()){
tmp_ans += pq.top();
pq.pop();
}
for(int i=N-2;i>=0;i--){
for(auto &e : v_right[i]){
pq.push(e);
}
while(pq.size() > N - i - 1) pq.pop();
}
while(!pq.empty()){
tmp_ans += pq.top();
pq.pop();
}
ans.push_back(tmp_ans);
}
for(auto &e : ans) cout << e << endl;
return 0;
} |
#include <set>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iostream>
using namespace std;
int main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
int K[n], L[n], R[n];
vector<int> left, right;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> K[i] >> L[i] >> R[i];
if (L[i] > R[i]) left.push_back(i);
else right.push_back(i);
ans += max(L[i], R[i]);
}
sort(left.begin(), left.end(), [&](int i, int j) { return K[i] < K[j]; });
sort(right.begin(), right.end(), [&](int i, int j) { return K[i] > K[j]; });
multiset<int> ld, rd;
for (int i : left) {
ld.insert(L[i] - R[i]);
if (K[i] < ld.size()) {
ans -= *ld.begin();
ld.erase(ld.begin());
}
}
for (int i : right) {
rd.insert(R[i] - L[i]);
if (n - K[i] < rd.size()) {
ans -= *rd.begin();
rd.erase(rd.begin());
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >> T;
for (int t = 0; t < T; t++){
[](){
int n;
cin >> n;
vector<int64_t> K(n), L(n), R(n);
for (int i = 0; i < n; i++){
cin >> K[i] >> L[i] >> R[i];
K[i]--;
}
vector<vector<int64_t>> LL(n), RR(n + 1);
int64_t ans = 0;
for (int i = 0; i < n; i++){
if (L[i] > R[i])
LL[K[i]].push_back(L[i] - R[i]);
else
RR[K[i] + 1].push_back(R[i] - L[i]);
ans += max(L[i], R[i]);
}
priority_queue<int64_t, vector<int64_t>, greater<int64_t>> Q;
for (int i = 0; i < n; i++){
for (const auto &ll: LL[i])
Q.push(ll);
while (Q.size() > i + 1){
ans -= Q.top();
Q.pop();
}
}
while (!Q.empty())
Q.pop();
for (int i = n; i >= 0; i--){
for (const auto &rr: RR[i])
Q.push(rr);
while (Q.size() > n - i){
ans -= Q.top();
Q.pop();
}
}
cout << ans << endl;
}();
}
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 10010;
int n;
void solve() {
cin >> n;
vector <int> infrontbetter[n+2];
vector <int> behindbetter[n+2];
int ans = 0;
for (int i =1;i<=n;i++) {
int k, l, r; cin >> k >> l >> r;
if (l >= r) infrontbetter[k].push_back(l - r);
else behindbetter[k].push_back(r - l);
ans += min(l,r);
}
//cout << "ANS: " << ans << "\n";
multiset <int> S;
for (int i = 1; i<= n;i++) {
for (auto j : infrontbetter[i]) {
S.insert(j);
}
while ((int) S.size() > i) S.erase(S.begin());
}
for (auto i: S) ans += i;
//cout << "ANS: " << ans << "\n";
S.clear();
for (int i = n; i >= 2; i--) {
for (auto j: behindbetter[i-1]) {
S.insert(j);
}
//for (auto j : S) cout << j << "\n";
while ((int) S.size() > (n - i + 1)) S.erase(S.begin());
}
for (auto i: S) ans += i;
//cout << "ANS: " << ans << "\n";
cout << ans << "\n";
}
int32_t main() {
FAST
int tc; cin >> tc;
while (tc--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
void solve() {
int n; cin >> n;
vector<ll> K(n), L(n), R(n);
priority_queue<ll, vector<ll>, greater<ll>> q;
map<int, vector<int>> mpp, mpm;
ll ans = 0;
int np = 0, nm = 0;
rep(i, n) {
cin >> K[i] >> L[i] >> R[i];
K[i]--;
if(L[i]-R[i]>=0) {
mpp[K[i]].push_back(i);
np++;
} else {
mpm[n-K[i]-2].push_back(i);
nm++;
}
ans += min(L[i], R[i]);
}
rep(i, n) {
for(int j: mpp[i]) q.push(L[j]-R[j]);
while((int)q.size() > min(i+1, np)) q.pop();
}
while(!q.empty()) {
ans += q.top(); q.pop();
}
rep(i, n) {
for(int j: mpm[i]) q.push(R[j]-L[j]);
while((int)q.size() > min(i+1, nm)) q.pop();
}
while(!q.empty()) {
ans += q.top(); q.pop();
}
cout << ans << "\n";
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t; cin >> t;
rep(_, t) solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll t;
cin >> t;
while(t--) {
ll n;
cin >> n;
priority_queue<ll,vec,greater<ll>> q;
ll ans=0;
mat a(n),b(n+1);
for(ll i=0;i<n;i++) {
ll k,l,r;
cin >> k >> l >> r;
k--;
ans+=min(l,r);
if(l-r>0) {
a[k].push_back(l-r);
}
else if(l-r<0) {
b[k+1].push_back(r-l);
}
}
for(ll i=0;i<n;i++) {
for(ll v:a[i]) {
q.push(v);
}
while(q.size()>i+1) q.pop();
}
while(q.size()) {
ans+=q.top();
q.pop();
}
for(ll i=n-1;i;i--) {
for(ll v:b[i]) {
q.push(v);
}
while(q.size()>n-i) q.pop();
}
while(q.size()) {
ans+=q.top();
q.pop();
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll T;
cin >> T;
for (ll testcase = 0; testcase < T; ++testcase) {
ll N;
cin >> N;
vector<vector<ll>> left(N);
vector<vector<ll>> right(N);
ll ans = 0;
for (ll i = 0; i < N; ++i) {
ll K, L, R;
cin >> K >> L >> R;
K -= 1;
ans += min(L, R);
if (L > R) {
left.at(K).push_back(L - R);
}
else {
if (K != N - 1) {
right.at(K + 1).push_back(R - L);
}
}
}
multiset<ll> ls;
for (ll i = 0; i < N; ++i) {
for (ll j = 0; j < left.at(i).size(); ++j) {
ls.insert(left.at(i).at(j));
}
while (ls.size() > (i + 1)) {
ls.erase(ls.begin());
}
}
for (auto itr = ls.begin(); itr != ls.end(); ++itr) {
ans += *(itr);
}
multiset<ll> rs;
for (ll i = N - 1; i >= 0; --i) {
for (ll j = 0; j < right.at(i).size(); ++j) {
rs.insert(right.at(i).at(j));
}
while (rs.size() > (N - 1 - i + 1)) {
rs.erase(rs.begin());
}
}
for (auto itr = rs.begin(); itr != rs.end(); ++itr) {
ans += *(itr);
}
cout << ans << "\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct C{
ll k, l;
};
vector<C> a, b;
int main()
{
int tt, T;
scanf("%d", &T);
for(tt=1; tt<=T; ++tt){
int n;
scanf("%d", &n);
a.clear(); b.clear();
ll ans = 0;
for(int i=0; i<n; ++i){
ll x, y, z;
scanf("%lld%lld%lld", &x, &y, &z);
if(x==n || y==z){ ans += y; continue; }
ll t = min(y,z);
ans += t; y -= t; z -= t;
if(z==0) a.push_back({x,y});
else b.push_back({n-x,z});
}
sort(a.begin(), a.end(), [&](C &a, C &b)->bool{return a.k<b.k;});
sort(b.begin(), b.end(), [&](C &a, C &b)->bool{return a.k<b.k;});
priority_queue<ll,vector<ll>,greater<ll>> q;
for(auto c : a){
if(q.size() >= c.k){
if(q.top() >= c.l) continue;
else q.pop();
}
q.push(c.l);
}
while(!q.empty()){ ans += q.top(); q.pop(); }
for(auto c : b){
if(q.size() >= c.k){
if(q.top() >= c.l) continue;
else q.pop();
}
q.push(c.l);
}
while(!q.empty()){ ans += q.top(); q.pop(); }
printf("%lld\n", ans);
}
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<pair<int, int> > l1;
priority_queue<int, vector<int>, greater<int> > q1;
vector<pair<int, int> > l2;
priority_queue<int, vector<int>, greater<int> > q2;
signed main() {
int t, n, k, l, r, s1, s2;
cin >> t;
while(t--) {
s1 = 0;
s2 = 0;
int n;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> k >> l >> r;
if(l < r) {
l2.push_back({n-k, r-l});
}
else l1.push_back({k, l-r});
s1 += min(l, r);
}
sort(l1.begin(), l1.end());
sort(l2.begin(), l2.end());
for(int i = 0; i < l1.size(); i++) {
if(l1[i].first == 0) continue;
if(q1.size() < l1[i].first) q1.push(l1[i].second);
else if(q1.size() == l1[i].first && q1.top() < l1[i].second) {
q1.pop();
q1.push(l1[i].second);
}
}
while(q1.size()) {
s1 += q1.top();
q1.pop();
}
for(int i = 0; i < l2.size(); i++) {
if(l2[i].first == 0) continue;
if(q2.size() < l2[i].first) q2.push(l2[i].second);
else if(q2.size() == l2[i].first && q2.top() < l2[i].second) {
q2.pop();
q2.push(l2[i].second);
}
}
while(q2.size()) {
s1 += q2.top();
q2.pop();
}
cout << s1 << '\n';
vector<pair<int, int> >().swap(l1);
vector<pair<int, int> >().swap(l2);
}
} |
#include<iostream>
using namespace std;
int main(){
int a[33]={1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51};
int k;
cin >> k;
cout << a[k-1] << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[33]={0,1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<a[k];
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n, a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main(){
cin >> n;
cout << a[n-1] << endl;
} |
#include<iostream>
#include<string>
using namespace std;;
int main(){
int s[33]={0,1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51};
int n;
cin>>n;
cout<<s[n];
return 0;
} |
#include <stdio.h>
int main(void) {
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51}, k;
scanf("%d", &k);
printf("%d", a[--k]);
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int a[50]={0,1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k; cin>>k;
cout<<a[k]<<endl;
} |
#include<iostream>
using namespace std;
int main(){
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int n;
cin>>n;
cout<<a[n-1];
}
|
#include <iostream>
using namespace std;
int main() {
int i;
cin >> i;
int k[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cout << k[i - 1];
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[32]={1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51},b;
cin>>b;
b--;
cout<<a[b];
return 0;
}
|
#include <stdio.h>
int a[50]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51},n;
int main () {
int n;
scanf ("%d",&n);
printf ("%d\n",a[n-1]);
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int>a;
a={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >>k;
cout << a.at(k-1);
}
|
#include<iostream>
using namespace std;
int main()
{
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<a[k-1];
} |
#include <cstdio>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int ar[]={1,1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
printf("%d",ar[n]);
} |
#include <bits/stdc++.h>
using namespace std;
int k,n,arr[33] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main(){
cin>>k;
cout<<arr[k]<<endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.