text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve(int num, std::istream& in, std::ostream& out) {
int n, k;
in >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
in >> arr[i];
}
sort(arr.begin(), arr.end());
int count = 0;
for (auto x : arr) {
int lo = x, hi = x + k;
auto itLo = upper_bound(arr.begin(), arr.end(), lo);
if (itLo == arr.end())
count++;
else if (*itLo > hi)
count++;
}
out << count;
}
};
void solve(std::istream& in, std::ostream& out) {
out << std::setprecision(12);
Solution solution;
solution.solve(0, in, out);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
istream& in = cin;
ostream& out = cout;
solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long n, k;
cin >> n >> k;
long long a[n];
for (int i = 0; i < n; i++) cin >> a[i];
vector<pair<long long, long long> > v;
map<long long, long long> m;
map<long long, long long>::iterator it;
for (int i = 0; i < n; i++) m[a[i]]++;
for (it = m.begin(); it != m.end(); it++)
v.push_back({it->first, it->second});
long long x = v.size();
long long res = n;
for (int i = 0; i < x - 1; i++) {
if (v[i + 1].first <= v[i].first + k) res -= v[i].second;
}
cout << res << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
long long result = n;
long long same = 0;
for (long long i = 0; i < n - 1; i++) {
if (a[i + 1] > a[i]) {
if ((a[i + 1] - a[i]) <= k) {
result -= (same + 1);
}
same = 0;
} else {
same++;
}
}
cout << result;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
long long a[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
sort(a, a + n);
int ans = 0;
for (int i = 0; i < n - 1; i++) {
int d = lower_bound(a + 1, a + n, a[i] + 1) - a;
int p = lower_bound(a + 1, a + n, a[i] + k) - a;
if (d >= n) continue;
if (a[d] - a[i] <= k) {
ans++;
continue;
}
if (p >= n) continue;
if (a[p] - a[i] <= k) continue;
}
printf("%d\n", n - ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1e5 + 5;
int a[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int ans = 0;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
int pos = upper_bound(a + i + 1, a + n + 1, a[i]) - a;
if (pos > n) continue;
if (a[i] + k >= a[pos]) ans++;
}
printf("%d\n", n - ans);
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> k(n), l(n), r(n);
for (int i = 0; i < n; i++) {
cin >> k.at(i) >> l.at(i) >> r.at(i);
}
int64_t s = 0;
vector<pair<int, int>> al, ar;
for (int i = 0; i < n; i++) {
s += min(l.at(i), r.at(i));
if (l.at(i) > r.at(i)) {
al.emplace_back(k.at(i), max(l.at(i), r.at(i)) - min(l.at(i), r.at(i)));
} else {
ar.emplace_back(n - k.at(i), max(l.at(i), r.at(i)) - min(l.at(i), r.at(i)));
}
}
sort(al.rbegin(), al.rend());
sort(ar.rbegin(), ar.rend());
priority_queue<int> q;
int64_t ans = s;
int j = 0;
for (int i = 0; i < n; i++) {
while (j < al.size() and al.at(j).first == n - i) {
q.push(al.at(j).second);
j++;
}
if (q.empty()) continue;
ans += q.top();
q.pop();
}
while (!q.empty()) {
q.pop();
}
j = 0;
for (int i = 0; i < n; i++) {
while (j < ar.size() and ar.at(j).first == n - i) {
q.push(ar.at(j).second);
j++;
}
if (q.empty()) continue;
ans += q.top();
q.pop();
}
cout << ans << "\n";
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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() {
int ts;
cin >> ts;
rep(ti,ts) solve();
return 0;
}
|
#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)
p.first = min(p.first, N);
sort(v.rbegin(), v.rend());
priority_queue<ll> pq;
ll res = 0;
for (int i = N, j = 0; i > 0; i--)
{
while (j < N && v[j].first == i)
{
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);
if (l > r)
left.emplace_back(k, l - r);
if (r > l)
right.emplace_back(N - k, r - l);
}
ans += cost(left);
ans += cost(right);
cout << ans << "\n";
}
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef pair<int, int> P;
#define MAX 100005
#define INF 1001001001
int main(int, char**)
{
int t;
cin >> t;
rep(_,t) {
int n;
cin >> n;
vector< priority_queue<P> > diff(2);
ll ans = 0;
rep(i,n) {
int k, l, r;
cin >> k >> l >> r;
if (l >= r) {
diff[0].push({k-1,l-r});
ans += r;
} else {
diff[1].push({n-k-1,r-l});
ans += l;
}
}
rep(i,2) {
int ds = diff[i].size();
priority_queue<int> q;
rep(j,ds) {
while(!diff[i].empty() && diff[i].top().first >= ds-j-1) {
q.push(diff[i].top().second); diff[i].pop();
}
if (!q.empty()) { ans += q.top(); q.pop(); }
}
}
cout << ans << endl;
}
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)
{
cin >> 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<iostream>
#include<queue>
#include<algorithm>
using namespace std;
int T,N;
int main()
{
cin>>T;
for(;T--;)
{
cin>>N;
vector<pair<int,pair<int,int> > >L[2];
long ans=0;
for(int i=0;i<N;i++)
{
int k,l,r;cin>>k>>l>>r;
if(l>r)
{
L[0].push_back(make_pair(k,make_pair(l,r)));
}
else if(l<r)
{
L[1].push_back(make_pair(N-k,make_pair(r,l)));
}
else ans+=l;
}
for(int id=0;id<2;id++)
{
priority_queue<pair<int,int> >P;
vector<vector<pair<int,int> > >tmp(N);
for(pair<int,pair<int,int> >p:L[id])
{
if(p.first==0)ans+=p.second.second;
else tmp[p.first-1].push_back(p.second);
}
for(int i=N;i--;)
{
for(pair<int,int>p:tmp[i])P.push(make_pair(p.first-p.second,p.first));
if(i<L[id].size()&&!P.empty())
{
ans+=P.top().second;
P.pop();
}
}
while(!P.empty())
{
ans+=P.top().second-P.top().first;
P.pop();
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t; cin >> t;
for (; t; t--) {
int n; cin >> n;
vector<int> k(n), l(n), r(n);
vector<pair<int, int>> vl(n);
for (int i = 0; i < n; i++) {
cin >> k[i] >> l[i] >> r[i];
k[i]--;
vl[i] = {(l[i] - r[i]), i};
}
sort(vl.rbegin(), vl.rend());
int ans = 0;
set<int> q;
for (int i = 0; i < n; i++) q.insert(i);
for (int i = 0; i < n; i++) {
if (vl[i].first <= 0) break;
int id = vl[i].second;
auto t = q.upper_bound(k[id]);
if (t == q.begin()) {
ans += r[id];
}
else {
ans += l[id];
t--;
q.erase(t);
}
}
for (int i = 0; i < n; i++) q.insert(i);
for (int i = n - 1; i >= 0; i--) {
if (vl[i].first > 0) break;
int id = vl[i].second;
auto t = q.upper_bound(k[id]);
if (t == q.end()) ans += l[id];
else {
ans += r[id];
q.erase(t);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <queue>
#define maxn 102333
using namespace std;
int main() {
int T;
scanf("%d", &T);
while(T--) {
priority_queue< pair<int, int> > Ql, Qr;
int n;
scanf("%d", &n);
long long ans = 0;
for(int i = 1; i <= n; ++i) {
int k, l, r;
scanf("%d%d%d", &k, &l, &r);
ans += min(l, r);
if(l > r) Ql.push(make_pair(k, l - r));
else Qr.push(make_pair(n - k, r - l));
}
priority_queue< int > Q;
for(int i = (signed) Ql.size() - 1; i >= 0; --i) {
while(!Ql.empty() && Ql.top().first > i) {
Q.push(Ql.top().second);
Ql.pop();
}
if(!Q.empty()) {
ans += Q.top();
Q.pop();
}
}
Q = decltype(Q)();
for(int i = (signed) Qr.size() - 1; i >= 0; --i) {
while(!Qr.empty() && Qr.top().first > i) {
Q.push(Qr.top().second);
Qr.pop();
}
if(!Q.empty()) {
ans += Q.top();
Q.pop();
}
}
printf("%lld\n", ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using VI = vector <int>;
using ll = long long;
ll solve(int n, VI pos, VI L, VI R) {
vector <vector <int> > V(n+1);
for (int i = 0; i < n; i ++) {
int val = R[i] - L[i];
V[pos[i]].push_back(val);
}
ll ans = accumulate(L.begin(), L.end(), 0ll);
priority_queue <int> pq;
for (int i = 0; i <= n; i ++) {
for (auto x : V[i]) pq.push(x);
while (pq.size() > i) {
ans += pq.top();
pq.pop();
}
}
return ans;
}
int main() {
cin.tie(0); ios::sync_with_stdio(0); cout.tie(0);
int T, n;
cin >> T;
while (T --) {
cin >> n;
VI K(n+1), L(n+1), R(n+1);
VI vl, vr;
for (int i = 1; i <= n; i ++) {
cin >> K[i] >> L[i] >> R[i];
if (L[i] >= R[i]) vl.push_back(i);
else vr.push_back(i);
}
ll ans = 0;
vector <int> pos, l, r;
int sz = vl.size();
for (auto x : vl) {
pos.push_back(min(sz, K[x]));
l.push_back(L[x]);
r.push_back(R[x]);
}
ans += solve(sz, pos, l, r);
pos.clear(), l.clear(), r.clear();
sz = vr.size();
for (auto x : vr) {
pos.push_back(min(sz, n - K[x]));
l.push_back(R[x]);
r.push_back(L[x]);
}
ans += solve(sz, pos, l, r);
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
int main(){
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
//cout.tie(NULL);
//freopen("in.txt","r",stdin);
int T;
cin>>T;
while(T--){
int n;
cin>>n;
long long sum=0; //最后的答案
vector<pair<int, int>>v, v2; //v用来存靠右的，v2用来存靠左的
set<int>s, s2;
for(int i=1;i<=n;i++){
int k, l, r;
cin>>k>>l>>r;
if(l<r) v.push_back({l-r, k});
else v2.push_back({l-r, k});
sum+=r; //先加上r
}
for(int i=1;i<=v2.size();i++) s2.insert(i); //s2 存靠左的个数
for(int i=v2.size()+1;i<=n;i++) s.insert(i); //s用来存靠右的个数
sort(v.begin(), v.end()); //对于靠右，r大的排前面
sort(v2.begin(), v2.end());
reverse(v2.begin(), v2.end()); //对于靠左 l大的排前面
for(auto i:v){
auto it=s.upper_bound(i.second);
if(it==s.end()) {
sum+=i.first;
s.erase(s.begin());
}
else s.erase(it);
}
for(auto i:v2){
auto it=s2.upper_bound(i.second);
if(it!=s2.begin()){
it--;
s2.erase(it);
sum+=i.first;
}else{
s2.erase(--s2.end());
}
}
cout<<sum<<"\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> ii;
int T;
int n;
int k[200005];
ii lr[200005];
vector <int> lrm, lrl;
set <int> mset;
set <int, greater <int> > lset;
long long ans;
bool mcomp(int l, int r) {
return (lr[l].first - lr[l].second) > (lr[r].first - lr[r].second);
}
bool lcomp(int l, int r) {
return (lr[l].first - lr[l].second) < (lr[r].first - lr[r].second);
}
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
ans = 0;
lrm.clear();
lrl.clear();
mset.clear();
lset.clear();
for (int i = 0; i < n; i++) {
int l, r; scanf("%d%d%d", &k[i], &l, &r);
lr[i] = ii(l, r);
if (l >= r) lrm.push_back(i);
else lrl.push_back(i);
}
sort(lrm.begin(), lrm.end(), mcomp);
sort(lrl.begin(), lrl.end(), lcomp);
for (int i = 1; i <= n; i++) {
mset.insert(i);
lset.insert(i);
}
for (int i : lrm) {
auto p = mset.upper_bound(k[i]);
if (p == mset.begin()) {
ans += lr[i].second;
} else {
ans += lr[i].first;
mset.erase(--p);
}
}
for (int i : lrl) {
auto p = lset.lower_bound(k[i]);
if (p == lset.begin()) {
ans += lr[i].first;
} else {
ans += lr[i].second;
lset.erase(--p);
}
}
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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() {
int ts;
cin >> ts;
rep(ti, ts) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+13;
struct node{
int val,pos;
bool operator <(const node &b)
const{
return pos<b.pos;//从小到大
}
}a[maxn],b[maxn];
priority_queue<int,vector<int>,greater<int> > q;//greater默认小根堆
int main()
{
int t,n;
scanf("%d",&t);
while(t--)
{
int k,l,r;
ll ans=0;
int cnt1=0,cnt2=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&k,&l,&r);
if(l>r) ans+=1ll*r,a[++cnt1]=(node){l-r,k};
else ans+=1ll*l,b[++cnt2]=(node){r-l,n-k};
}
sort(a+1,a+1+cnt1);
sort(b+1,b+1+cnt2);
for(int i=1;i<=cnt1;i++)
{
if(q.size()<a[i].pos) q.push(a[i].val);
else if(q.size()==a[i].pos)
{
if(a[i].val>q.top()) q.push(a[i].val),q.pop();
}
}
while(!q.empty()) ans+=1ll*q.top(),q.pop();
for(int i=1;i<=cnt2;i++)
{
if(q.size()<b[i].pos) q.push(b[i].val);
else if(q.size()==b[i].pos)
{
if(b[i].val>q.top()) q.push(b[i].val),q.pop();
}
}
while(!q.empty()) ans+=1ll*q.top(),q.pop();
printf("%lld\n",ans);
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll calc(vector<pair<int, int>> &a) {
int n = a.size();
set<int> free;
for (int i = 1; i <= n; i++) free.insert(i);
sort(a.rbegin(), a.rend());
ll ans = 0;
for (auto[v, p] : a) {
auto it = free.upper_bound(p);
if (it != free.begin()) {
it--;
free.erase(it);
ans += v;
}
}
return ans;
}
void solve() {
int n;
scanf("%d", &n);
vector<pair<int, int>> pos, neg;
ll tot = 0;
for (int i = 0; i < n; i++) {
int k, l, r;
scanf("%d%d%d", &k, &l, &r);
if (l > r) {
tot += r;
pos.push_back({l - r, k});
} else {
tot += l;
neg.push_back({r - l, n - k});
}
}
printf("%lld\n", tot + calc(pos) + calc(neg));
}
int main() {
int t;
scanf("%d", &t);
while (t--) solve();
}
|
#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(){
//freopen("b.in","r",stdin);
//freopen("b.out","w",stdout);
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>
using namespace std;
int read() {
int x; scanf("%d", &x); return x;
}
const int maxn = 3e5 + 10;
const int INF = 1e9;
int mod = 1e9 + 7;
using namespace std;
#define ll long long
int n, a[maxn], b[maxn];
ll ans;
bool cmp(pair<int,int> a, pair<int,int> b) {
return a.first == b.first ? a.second > b.second : a.first > b.first;
}
void Solve(vector<pair<int,int> >&a) {
set<int>X;
for (int i = 1; i <= n; ++i) X.insert(i);
for (int i = 0; i < a.size(); ++i) {
pair<int,int>u = a[i];
set<int>::iterator It = X.upper_bound(u.second);
if (It != X.begin()) {
X.erase(--It);
ans += u.first;
}
}
}
int main() {
#ifdef LOCAL
freopen("1.in", "r", stdin);
#endif
int T = read();
while (T--) {
vector<pair<int,int> >L, R;
n = read(); ans = 0;
for (int i = 1; i <= n; ++i) {
int k = read(), l = read(), r = read();
ans += min(l, r);
if (l > r) L.push_back(make_pair(l - r, k));
else R.push_back(make_pair(r - l, n - k));
}
sort(L.begin(), L.end(), cmp);
sort(R.begin(), R.end(), cmp);
Solve(L); Solve(R);
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,ll>;
int main() {
int t;
cin >> t;
rep(_,t){
int n;
cin >> n;
ll ans = 0;
vector<P> vl,vr;
rep(i,n){
ll k,l,r;
cin >> k >> l >> r;
ans += min(l,r);
if(l>r) vl.emplace_back(k,l-r);
if(l<r) vr.emplace_back(n-k,r-l);
}
sort(vl.rbegin(),vl.rend());
sort(vr.rbegin(),vr.rend());
int i=0; priority_queue<ll> q;
rep(_k,int(vl.size())){
int k = vl.size()-_k;
while(i<vl.size()&&vl[i].first>=k) q.emplace(vl[i++].second);
if(!q.empty()) ans+=q.top(),q.pop();
}
i=0; q = priority_queue<ll>();
rep(_k,int(vr.size())){
int k = vr.size()-_k;
while(i<vr.size()&&vr[i].first>=k) q.emplace(vr[i++].second);
if(!q.empty()) ans+=q.top(),q.pop();
}
cout << ans << endl;
}
}
|
#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
li calc(vector<pair<int,li>>& vec){
int n=vec.size();
if(n==0) return 0;
rep(i,n) vec[i].first*=-1;
sort(vec.begin(),vec.end());
rep(i,n) vec[i].first*=-1;
li s=0;
int i=0,i0=vec[0].first;
multiset<li> st;
while(i0){
while(i<n and vec[i].first==i0) st.insert(-vec[i++].second);
if(st.size()){
s-=*st.begin();
st.erase(st.begin());
}
i0--;
}
return s;
}
void solve(vector<int>& k,vector<li>& l,vector<li> r){
int n=k.size();
vector<pair<int,li>> lft,rgt;
li s=0;
rep(i,n){
if(r[i]<l[i]){
lft.push_back({k[i],l[i]-r[i]});
s+=r[i];
}
else if(l[i]<r[i]){
rgt.push_back({n-k[i],r[i]-l[i]});
s+=l[i];
}else{
s+=l[i];
}
}
print(s+calc(rgt)+calc(lft));
}
int main(){
int t; cin >>t;
rep(_,t){
int n; cin >>n;
vector<int> k(n);
vector<li> l(n),r(n);
rep(i,n){
cin >>k[i]>>l[i]>>r[i];
}
solve(k,l,r);
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#define rep(i, n) for(int i=0;i<(n);i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
ll f(vector<P> list) {
int n = list.size();
rep(i, n) list[i].first = min(list[i].first, n);
vector<vector<int> > ps(n+1);
for (int i = 0; i < n; i++) {
ps[list[i].first].push_back(list[i].second);
}
// 後ろから見ていく
priority_queue<int> que;
ll sum = 0;
for (int i = n; i >= 1; i--) {
for (int j : ps[i]) {
que.push(j);
}
if (!que.empty()) {
sum += que.top();
que.pop();
}
}
return sum;
}
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 T;
cin >> T;
rep(i, T) solve();
} |
#include<bits/stdc++.h>
#define ll long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<<"; "<<#b<<" = "<<b<<endl
using namespace std;
const ll INF = 1LL<<60;
const int inf = 1<<30;
const int maxn = 2e5+5;
inline void fastio() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
int n;
vector<pii_> lft,rgt;
ll cal(vector<pii_> a)
{
int n = a.size();
ll res = 0;
set<int> pos;
rep(i,1,n) pos.insert(i);
for(auto x:a){
auto it = pos.upper_bound(x.se);
if(it!=pos.begin()){
it--;
res += x.fi;
pos.erase(it);
}
}
return res;
}
int main()
{
fastio();
int _;
for(cin>>_;_;_--){
cin>>n; ll ans = 0;
lft.clear(),rgt.clear();
rep(i,1,n){
int k,l,r; cin>>k>>l>>r;
if(l>r) lft.pb({l-r,k}),ans+=r;
else rgt.pb({r-l,n-k}),ans+=l;
}
sort(lft.begin(),lft.end());sort(rgt.begin(),rgt.end());
reverse(lft.begin(),lft.end());reverse(rgt.begin(),rgt.end());
ans = ans + cal(lft) + cal(rgt);
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> d1[200005], d2[200005];
int main(){
int t;
scanf("%d", &t);
while(t--){
int n;
scanf("%d", &n);
for(int i=1;i<=n;i++) d1[i].clear(), d2[i].clear();
long long ans = 0;
for(int i=0;i<n;i++){
int l, r, k;
scanf("%d%d%d", &k, &l, &r);
if(l >= r){
d1[k].emplace_back(l-r);
ans += r;
}
else{
d2[n-k].emplace_back(r-l);
ans += l;
}
}
multiset<int> cur;
for(int i=1;i<=n;i++){
for(int j=0;j<d1[i].size();j++){
int val = d1[i][j];
cur.insert(val);
ans += val;
if(cur.size() > i){
ans -= *cur.begin();
cur.erase(cur.begin());
}
}
}
cur.clear();
for(int i=1;i<=n;i++){
for(int j=0;j<d2[i].size();j++){
int val = d2[i][j];
cur.insert(val);
ans += val;
if(cur.size() > i){
ans -= *cur.begin();
cur.erase(cur.begin());
}
}
}
printf("%lld\n", ans);
}
} |
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ithBit(m, i) ((m) >> (i) & 1)
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
const int maxN = 1 << 19;
long long f(int n, vector <pair <int, int> > T)
{
sort(ALL(T));
reverse(ALL(T));
set <int> S;
FOR(i, 0, n)
S.insert(i);
long long ret = 0;
for (auto [dx, i] : T)
{
auto it = S.lower_bound(i);
if (it != S.begin())
S.erase(prev(it)), ret += dx;
}
return ret;
}
void solve()
{
int n;
scanf ("%d", &n);
vector <pair <int, int> > front, back;
long long res = 0;
FOR(i, 0, n)
{
int k, l, r;
scanf("%d%d%d", &k, &l, &r);
if (k == n)
{
res += l;
continue;
}
res += min(l, r);
if (l > r)
front.pb({l - r, k});
if (r > l)
back.pb({r - l, n - k});
}
res += f(n, front);
res += f(n, back);
printf("%lld\n", res);
}
int main()
{
int t = 1;
scanf ("%d", &t);
while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T,N,k;
long long int total;
cin >> T;
for(int t=1;t<=T;t++)
{
total=0;
cin >> N;
long long int l,r;
vector<long long int> Ph[N],Pt[N];
priority_queue<long long int, vector<long long int>, greater<long long int>> H;
priority_queue<long long int, vector<long long int>, greater<long long int>> T;
for(int i=0;i<N;i++)
{
cin >> k >> l >> r;
k = k-1;
if(l>r)
{
Ph[k].push_back(l-r);
total = total +r;
}
else
{
Pt[k].push_back(r-l);
total = total + l;
}
}
for(int i=0;i<N;i++)
{
for(int j:Ph[i])
H.push(j);
while(H.size()>i+1)
H.pop();
}
for(int i=0;i<N;i++)
{
for(int j:Pt[N-i-1])
T.push(j);
while(T.size()>i)
T.pop();
}
while(H.size())
{
total = total + H.top();
H.pop();
}
while(T.size())
{
total = total + T.top();
T.pop();
}
cout << total <<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long T;
cin >> T;
for(int t=0;t<T;t++){
long long N,ans=0;
cin >> N;
vector<pair<long long,long long>> A(0),B(0);
for(int i=0;i<N;i++){
long long k,l,r;
cin >> k >> l >> r;
k--;
if(l>r){
A.push_back(make_pair(l-r,k));
ans += r;
}
else if(l<r){
B.push_back(make_pair(r-l,N-k-2));
ans += l;
}
else ans += l;
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
sort(B.begin(),B.end());
reverse(B.begin(),B.end());
set<long long> Sa;
for(int i=0;i<N;i++) Sa.insert(i);
for(int i=0;i<A.size();i++){
auto it = Sa.upper_bound(A[i].second);
if(it!=Sa.begin()){
it--;
Sa.erase(*it);
ans += A[i].first;
}
}
set<long long> Sb;
for(int i=0;i<Sa.size();i++) Sb.insert(i);
for(int i=0;i<B.size();i++){
auto it = Sb.upper_bound(B[i].second);
if(it!=Sb.begin()){
it--;
Sb.erase(*it);
ans += B[i].first;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MX=0;
int n,k,l,r;
void solve(void){
cin>>n;
priority_queue<P>a,b;
ll ans=0;
rep(i,n){
cin>>k>>l>>r;
if(l>r)a.emplace(P(k-1,l-r)),ans+=r;
else b.emplace(P(n-k-1,r-l)),ans+=l;
}
int x=a.size(),y=b.size();
priority_queue<int>q1,q2;
for(int i=x-1; i>=0; --i){
while(!a.empty()){
if(a.top().first>=i){
q1.emplace(a.top().second);
a.pop();
}
else break;
}
if(!q1.empty()){
ans+=q1.top();
q1.pop();
}
}
for(int i=y-1; i>=0; --i){
while(!b.empty()){
if(b.top().first>=i){
q2.emplace(b.top().second);
b.pop();
}
else break;
}
if(!q2.empty()){
ans+=q2.top();
q2.pop();
}
}
cout<<ans<<endl;
}
int main(){
int T;
scanf("%d", &T);
while(T--){
solve();
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#define k first
#define w second
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int N=200010;
pii a[N],b[N];
int main()
{
int T;
cin>>T;
while(T--)
{
int n,cnta=0,cntb=0;
cin>>n;
ll res=0;
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++]={k,l-r};
else res+=l,b[cntb++]={n-k,r-l};
}
sort(a,a+cnta),sort(b,b+cntb);
priority_queue<int,vector<int>,greater<int> >heap;
for(int i=0;i<cnta;i++)
{
heap.push(a[i].w);
while(heap.size()>a[i].k) heap.pop();
}
while(heap.size())
{
res+=heap.top();
heap.pop();
}
for(int i=0;i<cntb;i++)
{
heap.push(b[i].w);
while(heap.size()>b[i].k) heap.pop();
}
while(heap.size())
{
res+=heap.top();
heap.pop();
}
cout<<res<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
bool cmp(pair<lli,lli> & a, pair<lli,lli> & b)
{
return a.first > b.first;
}
lli solve(vector<pair<lli, lli>> & v, lli n)
{
set<lli> free;
lli ans = 0;
for(int i=1;i<=n;i++) free.insert(i);
for(auto [val, pos] : v)
{
auto it = free.upper_bound(pos);
if(it != free.begin())
{
it--;
ans += val;
free.erase(*it);
}
}
return ans;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
lli t;
cin>>t;
while(t--)
{
lli n;
cin>>n;
lli i, k[n+1], l[n+1], r[n+1], ans=0;
vector<pair<lli,lli>> v1, v2;
for(i=1;i<=n;i++) cin>>k[i]>>l[i]>>r[i];
for(i=1;i<=n;i++)
{
if(l[i] > r[i]) v1.push_back({l[i] - r[i], k[i]}), ans += r[i];
else v2.push_back({r[i] - l[i], n - k[i]}), ans += l[i];
}
sort(v1.begin(), v1.end(), cmp);
sort(v2.begin(), v2.end(), cmp);
cout<<ans + solve(v1, n) + solve(v2, n)<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ld long double
#define pii pair<int,int>
#define fi first
#define se second
#define mex 1000005
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//vector<int> adj[mex];
//a+b=a^b+2*(a&b)
// FIRST THINK, THEN CODE
// DO NOT JUMP BETWEEN PROBLEMS
int main(){
fast
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int k[n],l[n],r[n];
for(int i=0;i<n;i++)
cin>>k[i]>>l[i]>>r[i];
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>> > p1,p2;
ll s=0;
vector<pair<ll,ll>> v1,v2;
for(int i=0;i<n;i++){
if(l[i]>=r[i]){
s=s+r[i];
v1.push_back({k[i],l[i]-r[i]});
}
}
sort(v1.begin(),v1.end());
for(int i=0;i<v1.size();i++){
p1.push({v1[i].se,v1[i].fi});
if(p1.size()>v1[i].fi)
p1.pop();
}
while(!p1.empty()){
s=s+p1.top().fi;
//cout<<(p1.top().fi)<<endl;
p1.pop();
}
//cout<<s<<endl;
for(int i=0;i<n;i++){
if(r[i]>l[i]){
s=s+l[i];
v2.push_back({k[i],r[i]-l[i]});
}
}
sort(v2.rbegin(),v2.rend());
for(int i=0;i<v2.size();i++){
p2.push({v2[i].se,v2[i].fi});
if(p2.size()>n-v2[i].fi)
p2.pop();
}
while(!p2.empty()){
s=s+p2.top().fi;
p2.pop();
}
cout<<s<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(int n,vector<pair<int,ll>> a) {
sort(a.begin(),a.end());
ll sol=0;
priority_queue<ll> pq;
for (auto &it : a) {
int i=it.first;
ll x=it.second;
if ((int) pq.size()<i) {
pq.push(-x);
sol+=x;
} else {
ll y=-pq.top();
if (x>y) {
pq.pop();
pq.push(-x);
sol+=x-y;
}
}
}
return sol;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while (t--) {
int n;
cin>>n;
vector<pair<int,ll>> a,b;
ll sol=0;
for (int i=1;i<=n;i++) {
int k,l,r;
cin>>k>>l>>r;
if (l>=r) {
sol+=r;
a.push_back({k,l-r});
} else {
sol+=l;
if (k!=n) {
b.push_back({n-k,r-l});
}
}
}
sol+=solve(n,a);
sol+=solve(n,b);
cout<<sol<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long ans = 0;
vector<pair<int, int>> right, left;
for (int i = 0; i < n; ++i) {
int k, l, r;
cin >> k >> l >> r;
ans += min(l, r);
if (l < r) {
right.emplace_back(r - l, n - k);
} else if (l > r) {
left.emplace_back(l - r, k);
}
}
sort(right.rbegin(), right.rend());
sort(left.rbegin(), left.rend());
auto proc = [&ans, &n](vector<pair<int, int>> left) {
set<int> ndx;
for (int i = 1; i <= n; ++i) {
ndx.insert(i);
}
for (auto [x, k] : left) {
auto it = ndx.upper_bound(k);
if (it != ndx.begin()) {
ndx.erase(--it);
ans += x;
}
}
};
proc(left);
proc(right);
cout << ans << "\n";
}
}
|
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int n;ll sum;
inline void solve(){
vector<pii>v1,v2;
set<int>s1,s2;
cin>>n;sum=0;
for(int i=1,l,r,k;i<=n;++i){
cin>>k>>l>>r;sum+=r;
if(l>r)v1.push_back({l-r,k});
else v2.push_back({l-r,k});
}
for(int i=1;i<=v1.size();++i)s1.insert(i);
for(int i=v1.size()+1;i<=n;++i)s2.insert(i);
sort(v1.rbegin(),v1.rend());
sort(v2.begin(),v2.end());
for(int i=0;i<v1.size();++i){
pii p=v1[i];
set<int>::iterator it=s1.upper_bound(p.second);
if(it!=s1.begin()){
--it;
s1.erase(it);
sum+=p.first;
}
}
for(int i=0;i<v2.size();++i){
pii p=v2[i];
set<int>::iterator it=s2.upper_bound(p.second);
if(it==s2.end())sum+=p.first;
else s2.erase(it);
}
cout<<sum<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
int T;cin>>T;
for(;T--;)solve();
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define wzh(x) cerr<<#x<<' '<<x<<endl
int t,n;
struct uzi{
int k,l;
bool operator < (const uzi & t)const{
return k<t.k;
}
}L[N],R[N];
int dx,dy;
int main() {
ios::sync_with_stdio(false);
for(cin>>t;t;t--){
cin>>n;LL ans=0;dx=dy=0;
for(int i=1;i<=n;i++){
int k,l,r;
cin>>k>>l>>r;
if(l>r){
ans+=r;
L[++dx]={k,-l+r};
}else if(l<r){
ans+=l;
R[++dy]={k,-r+l};
}else ans+=l;
}
sort(L+1,L+1+dx);
sort(R+1,R+1+dy);
int x=1;
priority_queue<int>q;
for(int i=1;i<=n;i++){
while(x<=dx&&L[x].k==i)q.push(L[x].l),x++;
while(q.size()>i)q.pop();
}
while(!q.empty())ans-=q.top(),q.pop();
x=dy;
for(int i=n;i>=1;i--){
while(x>=1&&R[x].k==i)q.push(R[x].l),x--;
while(q.size()>n-i)q.pop();
}
while(!q.empty())ans-=q.top(),q.pop();
cout<<ans<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
void solve(){
int N;
cin >> N;
ll ans = 0;
vvec<pair<ll,ll>> list(N);
for(int i=0;i<N;i++){
int k,l,r;
cin >> k >> l >> r;
k--;
ans += min(l,r);
list[k].emplace_back(l,r);
}
priority_queue<ll,vec<ll>,greater<ll>> Q;
for(int i=0;i<N;i++){
for(auto& [l,r]:list[i]) if(l-r>=0){
ans += l-r;
Q.push(l-r);
}
while(Q.size()>i+1){
ans -= Q.top();
Q.pop();
}
}
while(!Q.empty()) Q.pop();
for(int i=N-1;i>=0;i--){
if(i){
for(auto& [l,r]:list[i-1]) if(r-l>0){
ans += r-l;
Q.push(r-l);
}
}
while(Q.size()>N-i){
ans -= Q.top();
Q.pop();
}
}
cout << ans << "\n";
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
while(T--){
solve();
}
} |
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N = 2e5 + 5;
const int oo = 1e9 + 5;
const LL ooll = 1e18 + 5;
void solve() {
int n;
cin >> n;
vector<array<int, 2>> v, w;
LL ans = 0;
for (int i=0;i<n;++i) {
int k, l, r;
cin >> k >> l >> r;
if (l >= r) {
v.push_back({k, l-r});
ans += r;
} else {
w.push_back({n-k, r-l});
ans += l;
}
}
int vsz = v.size(), wsz = w.size(), vit = 0, wit = 0;
sort(v.begin(), v.end()); sort(w.begin(), w.end());
multiset<int> st;
for (int i=1;i<=n;++i) {
while(vit<vsz && v[vit][0] == i) {
st.insert(v[vit][1]);
++vit;
}
while(st.size() > i) st.erase(st.begin());
}
for (auto it : st) {
ans += it;
}
st.clear();
while(wit < wsz && w[wit][0] < 1) wit++;
for (int i=1;i<=n;++i) {
while(wit < wsz && w[wit][0] == i) {
st.insert(w[wit][1]);
++wit;
}
while(st.size() > i) st.erase(st.begin());
}
for (auto it : st) ans += it;
cout << ans << '\n';
}
int main() {
FASTIO;
int T;
cin >> T;
while(T--) {
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve() {
int n; cin >> n;
vector<vector<int>> L(n), R(n);
ll res = 0;
for (int _ = 0; _ < n; _++) {
int k,l,r;
cin >> k >> l >> r;
if (k == n) {
res += l; continue;
}
if (l < r) {
res += l;
R[n-k].push_back(r-l);
} else {
res += r;
L[k].push_back(l-r);
}
}
{
priority_queue<int, vector<int>, greater<int>> hp;
for (int i = 1; i < n; i++) {
for (int x:L[i]) hp.push(x);
while (hp.size() > i) {
hp.pop();
}
}
while (!hp.empty()) {
res += hp.top(); hp.pop();
}
}
{
priority_queue<int, vector<int>, greater<int>> hp;
for (int i = 1; i < n; i++) {
for (int x:R[i]) hp.push(x);
while (hp.size() > i) {
hp.pop();
}
}
while (!hp.empty()) {
res += hp.top(); hp.pop();
}
}
cout << res << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T; cin >> T;
for (int t = 0; t < T; t++) {
solve();
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll f(vector<pii> 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<pii> 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(){
int ts;
cin >> ts;
rep(i,ts) solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;using ll = long long int;int main(){int T,N,k;ll o,l,r;cin>>T;while(T){T--;o=0;cin>>N;vector<ll> P[N],S[N];priority_queue<ll, vector<ll>, greater<ll>> H,T;for(int n=0;n<N;n++){cin>>k>>l>>r;if(l>r){P[k-1].push_back(l-r);o+=r;}else{S[k-1].push_back(r-l);o+=l;}}for(int i=0;i<N;i++){for(int j:P[i])H.push(j);while(H.size()>i+1)H.pop();for(int j:S[N-1-i])T.push(j);while(T.size()>i)T.pop();}while(!H.empty()){o=o+H.top();H.pop();}while(!T.empty()){o=o+T.top();T.pop();}cout<<o<<endl;}}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 2e5 + 5;
ll n, T, b[maxn], t = 0, m = 0 , k, a[maxn], ans, vit[maxn], f[maxn];
struct dang
{
ll x, y, dd;
};
dang c[maxn];
bool check, ck;
string s;
vector<ll> adj[2][maxn];
inline void sol()
{
cin >> n;
ans = 0;
for(int i = 1; i <= n; i ++)
{
ll k, l, r;
cin >> k >> l >> r;
if(l >= r)
{
adj[0][k].pb(l - r);
}
else
{
adj[1][n-k].pb({r - l});
}
ans += min(l, r);
}
for(int v = 0; v < 2; v ++)
{
priority_queue< ll, vector<ll>, greater<ll> >pr;
for(int i = 1; i <= n; i ++)
{
for(ll u : adj[v][i])
{
pr.push(u);
ans += u;
}
while((ll)pr.size() > i)
{
ans -= pr.top();
pr.pop();
}
}
}
cout << ans << '\n';
for(int i = 1; i <= n; i ++)adj[0][i].clear(), adj[1][i].clear();
}
int main()
{
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
cin >> T;
while(T -- > 0)
sol();
}
|
#include <bits/stdc++.h>
using namespace std;
struct dat {
long long k, l, r;
bool operator<(const dat &rd) const {
if (k != rd.k) return k < rd.k;
return l > rd.l;
}
};
long long n;
vector<dat> v, lv, rv;
long long solve();
int main() {
long long T;
cin >> T;
while (T--) {
cin >> n;
v.resize(n);
for (auto &p : v) cin >> p.k >> p.l >> p.r;
cout << solve() << endl;
}
return 0;
}
long long solve() {
long long res = 0, sum = 0;
lv.clear();
rv.clear();
for (int i = 0; i < n; ++i) {
sum += v[i].r;
v[i].l -= v[i].r;
v[i].r = 0;
if (v[i].l > 0)
lv.push_back(v[i]);
else if (v[i].l != 0)
rv.push_back(v[i]);
}
sort(lv.begin(), lv.end());
priority_queue<long long, vector<long long>, greater<long long>> pql;
int len = lv.size();
for (int i = 0; i < len; ++i) {
pql.push(lv[i].l);
while (pql.size() > lv[i].k) pql.pop();
}
while (pql.size()) {
res += pql.top();
pql.pop();
}
priority_queue<long long> pqr;
sort(rv.begin(), rv.end());
reverse(rv.begin(), rv.end());
len = rv.size();
for (int i = 0; i < len; ++i) {
rv[i].k = n - rv[i].k;
pqr.push(rv[i].l);
while (pqr.size() > rv[i].k) {
res += pqr.top();
pqr.pop();
}
}
return res + sum;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
int t;
cin>>t;
for(int T=0;T<t;T++){
int n,ans=0;
cin>>n;
priority_queue<pair<int,int>> lx,rx;
priority_queue<int> que;
int k,l,r;
for(int i=0;i<n;i++){
cin>>k>>l>>r;
ans+=min(l,r);
if(l>r){
lx.push({k,l-r});
}
if(l<r){
rx.push({-k,r-l});
}
}
int lp=lx.size();
for(int i=lp-1;i>=0;i--){
while(!lx.empty()&&lx.top().first>i){
que.push(lx.top().second);
lx.pop();
}
if(!que.empty()){
ans+=que.top();
que.pop();
}
}
while(!que.empty())que.pop();
for(int i=lp;i<n;i++){
while(!rx.empty()&&-rx.top().first<=i){
que.push(rx.top().second);
rx.pop();
}
if(!que.empty()){
ans+=que.top();
que.pop();
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll calc(vector<pair<ll,ll>> &vec, int n){
ll ret=0;
priority_queue<ll, vector<ll>, greater<ll>> que;
auto itr = vec.begin();
For(i,0,n+1){
while(itr < vec.end() && (*itr).first <= i){
que.push((*itr).second);
ret += (*itr).second;
itr++;
}
while(i<que.size()){
ret -= que.top();
que.pop();
}
}
return ret;
}
ll solve(){
int n;
cin >> n;
vector<pair<ll, ll>> left,right;
ll sum = 0;
For(i,0,n){
ll k,l,r;
cin >> k >> l >> r;
if(l>r){
sum += r;
left.push_back({k,l-r});
}
else{
sum += l;
right.push_back({n-k,r-l});
}
}
sort(ALL(left));
sort(ALL(right));
sum += calc(left,n) + calc(right,n);
return sum;
}
void Main(){
int t;
cin >> t;
vector<ll> ans(t);
For(i,0,t) ans[i] = solve();
For(i,0,t){
cout << ans[i] << endl;
}
}
int main(){
Main();
/*
東方風神録は神が出てくるので当然神ゲー
*/
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
//
ll f(vector<p>& pp){
// 独立に行っているのに、番号n-1(0-origin)より上は意味がないので矯正
for(auto& elm : pp){
elm.first = min(elm.first, (ll)(pp.size()));
}
vector<vector<ll> > s(pp.size()+1);
for(auto& elm : pp){
s[elm.first].push_back(elm.second);
}
ll res = 0;
priority_queue<ll> q;
for(int i = pp.size(); i >= 1; i--){
for(ll x : s[i]) q.push(x);
if(!q.empty()){
res += q.top();
q.pop();
}
}
return res;
}
void solve(){
int N;
cin >> N;
cin.ignore();
ll ans = 0;
vector<p> lp, rp;
for(int i = 0; i < N; i++){
ll k, l, r;
cin >> k >> l >> r;
cin.ignore();
ll m = min(l, r);
ans += m;
l -= m; r -= m;
if(l > 0){
lp.emplace_back(k, l);
} else {
rp.emplace_back(N - k, r);
}
}
ans += f(lp);
ans += f(rp);
cout << ans << endl;
return;
}
int main(){
int T;
cin >> T;
cin.ignore();
for(int i = 0; i < T; i++){
solve();
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#define LL long long
using namespace std;
const int N=2e5+10;
struct NODE{
int k,l,r;
bool operator <(const NODE &other)
const { return k<other.k; }
}node[N];
priority_queue<int,vector<int>,greater<int> >que;//小根堆,注意空格！！！！
int main()
{
int T,n;
scanf("%d",&T);
while(T)
{
T--;
LL sum=0;
LL now=0;
int cnt=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&node[i].k,&node[i].l,&node[i].r);
now+=max(node[i].l,node[i].r);
}
sort(node+1,node+n+1);
int j=1;
for(int i=1;i<=n;i++)
{
while(j<=n&&node[j].k<=i)
{
if(node[j].l>=node[j].r) //注意等于的情况不要漏掉
{
sum+=node[j].r;
que.push(node[j].l-node[j].r);
}
j++;
}
while(que.size()>i) que.pop();
}
while(que.size())
{
sum+=que.top();
cnt++;
que.pop();
}
j=n;
for(int i=n;i>0;i--)
{
while(j&&node[j].k>=i)
{
if(node[j].r>node[j].l)
{
sum+=node[j].l;
que.push(node[j].r-node[j].l);
}
j--;
}
while(que.size()>n-i) que.pop();
}
while(que.size())
{
sum+=que.top();
cnt++;
que.pop();
}
cout<<sum<<endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 200010
ll n,l[N],r[N],k[N];
vector<ll> v1[N],v2[N];
void solve(){
cin>>n;
rep(i,n+1){
v1[i].clear();
v2[i].clear();
}
ll base=0;
ll cnt1=0,cnt2=0;
rep(i,n){
cin>>k[i]>>l[i]>>r[i];
if(l[i]>=r[i]){
v1[k[i]-1].push_back(l[i]-r[i]);
base+=r[i];
cnt1++;
}
else{
v2[k[i]].push_back(r[i]-l[i]);
base+=l[i];
cnt2++;
}
}
priority_queue<ll> Q;
for(ll i=n-1;i>=0;i--){
for(auto v:v1[i])Q.push(v);
if(i<cnt1){
if(!Q.empty()){
base+=Q.top();
Q.pop();
}
}
}
while(!Q.empty())Q.pop();
for(ll i=0;i<n;i++){
for(auto v:v2[i])Q.push(v);
if(cnt1<=i){
if(!Q.empty()){
base+=Q.top();
Q.pop();
}
}
}
cout<<base<<"\n";
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll t;
cin>>t;
while(t--){
solve();
}
}
|
#include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Tue Jul 21 18:31:19 JST 2020
**/
void solve() {
Int n;
std::cin >> n;
std::vector<std::vector<Int>> bl(n), br(n);
Int ans = 0;
REP(i, n) {
Int k, l, r;
std::cin >> k >> l >> r, k--;
ans += std::min(l, r);
if (l > r) {
bl[k].push_back(l - r);
} else {
if (n - 2 - k >= 0) br[n - 2 - k].push_back(r - l);
}
}
for (auto& v : {bl, br}) {
std::priority_queue<Int> pq;
for (Int i = n - 1; i >= 0; i--) {
for (Int x : v[i]) pq.push(x);
if (pq.size()) ans += pq.top(), pq.pop();
}
}
std::cout << ans << "\n";
}
signed main() {
Int T;
std::cin >> T;
while (T--) solve();
}
|
#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<<"\n";
}
} |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define forn(i,n) for(int i = 0; i < (int) n; ++i)
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
vector<vector<int>> x(n, vector<int>(3));
forn(i, n) forn(j, 3) cin >> x[i][j];
sort(all(x), [&](const vector<int>& lhs, const vector<int>& rhs) {
return lhs[1] - lhs[2] > rhs[1] - rhs[2]; // sort by L-R
});
set<int> left;
forn(i,n) left.insert(i+1);
int first = n, skip = 0;
ll ans = 0;
forn(i, n) {
if (x[i][1] - x[i][2] < 0) {
first = i;
break;
}
// greatest e in left <= x[i][0]
auto it = left.upper_bound(x[i][0]);
if (it == left.begin()){
ans += x[i][2];
skip++;
continue;
}
--it;
left.erase(it);
ans += x[i][1];
}
left.clear();
for(int i = n - 1; i >= first; i--)
left.insert(i+1);
for(int i = n - 1; i >= first; i--) {
assert(x[i][1] - x[i][2] < 0);
// want to be in smallest e > x[i][0]
auto it = left.upper_bound(x[i][0]);
if (it == left.end()){
ans += x[i][1];
left.erase(left.begin());
continue;
}
left.erase(it);
ans += x[i][2];
}
cout << ans << "\n";
}
int main() {
ios;
int t;
cin >> t;
while(t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vp = vector<pair<int, int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
ll calc(vp 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;
vp pl, pr;
ll ans = 0;
rep(i, n) {
int k, l, r;
cin >> k >> l >> r;
if (l > r) {
ans += r;
pl.emplace_back(k, l - r);
} else {
ans += l;
pr.emplace_back(n - k, r - l);
}
}
ans += calc(pl);
ans += calc(pr);
cout << ans << endl;
}
int main() {
int t;
cin >> t;
while(t--) solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define PI acos(-1)
// code starts
typedef pair<int,int> P;
void solve()
{
int n;
cin >> n;
vector<int> k(n);
vector<int> l(n);
vector<int> r(n);
int i,j;
rep(i,n) cin >> k[i] >> l[i] >> r[i];
rep(i,n) k[i]--;
vector<vector<int>> vs(n);
ll ans = 0;
rep(i,n)
{
vs[k[i]].emplace_back(l[i]-r[i]);
}
priority_queue<int,vector<int>,greater<int>> pq;
rep(i,n)
{
rep(j,vs[i].size())
{
if(vs[i][j] >= 0)
{
pq.push(vs[i][j]);
}
}
while(pq.size() > i+1)
{
pq.pop();
}
}
while(!pq.empty())
{
ans += pq.top();
pq.pop();
}
for(i=n-1;i>=0;i--)
{
rep(j,vs[i].size())
{
if(vs[i][j] < 0)
{
pq.push(-vs[i][j]);
}
}
while(pq.size() > n-i-1)
{
pq.pop();
}
}
while(!pq.empty())
{
ans += pq.top();
pq.pop();
}
rep(i,n)
{
ans += min(l[i],r[i]);
}
cout << ans << "\n";
}
int main()
{
int t;
cin >> t;
int i;
rep(i,t) solve();
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll check(vector<pair<ll,ll>> vt){
ll n = vt.size();
for(int i=0;i<n;i++) vt[i].first=min(vt[i].first,n);
vector<vector<ll>> vs(n+1);
for(int i=0;i<n;i++) vs[vt[i].first].emplace_back(vt[i].second);
priority_queue<ll> que;
ll ans=0;
for(int i=n;i>0;i--){
for(auto u:vs[i]){
que.push(u);
}
if(!que.empty()){
ans+=que.top();
que.pop();
}
}
//cout << "ans:" << ans << endl;
return ans;
}
ll solve(){
int n;
cin >> n;
ll k,l,r;
ll ans = 0;
vector<pair<ll,ll>> right,left;
ll m;
for(int i=0;i<n;i++){
cin >> k >> l >> r;
/*m=min(l,r);
l-=m;
r-=m;
ans+=m;
if(l>0){
left.emplace_back(k,l);
}else{
right.emplace_back(n-k,r);
}*/
if(l>r){
ans+=r;
left.emplace_back(k,l-r);
}else{
ans+=l;
right.emplace_back(n-k,r-l);
}
}
//cout << "befor:" << ans << endl;
ans+=check(left);
ans+=check(right);
return ans;
}
int main(){
ll t;
cin >> t;
vector<ll> ans;
for(ll i=0;i<t;i++){
//solve();
ans.push_back(solve());
}
//cout << "ans" << endl;
for(ll i=0;i<t;i++){
cout << ans[i] << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
typedef long long ll;
int n;
vector<int> wl[maxN], wr[maxN];
void process() {
ll ans = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
int k, l, r;
cin >> k >> l >> r;
if (l >= r) {
wl[k].push_back(l-r);
} else {
wr[n-k].push_back(r-l);
}
ans = ans + min(l, r);
}
priority_queue<int, vector<int>, greater<int> > pq;
for (int i = 1; i <= n; ++i) {
for (auto v : wl[i]) {
pq.push(v);
ans += v;
}
while (pq.size() > i) {
int x = pq.top(); pq.pop();
ans -= x;
}
}
while (!pq.empty()) pq.pop();
for (int i = 1; i <= n; ++i) {
for (auto v : wr[i]) {
pq.push(v);
ans += v;
}
while (pq.size() > i) {
int x = pq.top(); pq.pop();
ans -= x;
}
}
cout << ans << '\n';
for (int i = 1; i <= n; ++i) {
wl[i].clear(); wr[i].clear();
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);
int t; cin >> t;
while (t--) process();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int find_par(int i,int par[])
{
if(par[i]==-1)
return -1;
if(i==par[i])
return i;
par[i]=find_par(par[i],par);
return par[i];
}
vector<pair<int,int> > v,v1;
long long ans=0;
void find_ans(int n,vector<pair<int,int> > &v)
{
int par[n];
for(int i=0;i<n;i++)
{
par[i]=i;
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
for(int i=0;i<v.size();i++)
{
if(v[i].second>=0)
{
int p=find_par(v[i].second,par);
if(p!=-1)
{
ans+=v[i].first;
par[p]=p-1;
}
}
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
v.clear();
v1.clear();
ans=0;
int n;
cin>>n;
int k[n];
int r[n];
int l[n];
for(int i=0;i<n;i++)
{
cin>>k[i]>>l[i]>>r[i];
k[i]--;
ans+=min(l[i],r[i]);
if(l[i]>=r[i])
{
v.push_back({l[i]-r[i],k[i]});
}
else
{
v1.push_back({r[i]-l[i],n-k[i]-2});
}
}
find_ans(n,v);
find_ans(n,v1);
cout<<ans<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int T, n;
vector<int> G[maxn], H[maxn];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
G[i].clear(), H[i].clear();
}
long long ans = 0;
for (int i = 1, K, L, R; i <= n; i++) {
scanf("%d %d %d", &K, &L, &R);
if (L > R) ans += R, G[K].push_back(L - R);
else ans += L, H[K].push_back(R - L);
}
multiset<int> S;
for (int i = 1; i <= n; i++) {
for (int j : G[i]) {
S.insert(j), ans += j;
}
while (S.size() > i) {
auto it = S.begin();
ans -= *it, S.erase(it);
}
}
S.clear();
for (int i = n; i; i--) {
for (int j : H[i]) {
S.insert(j), ans += j;
}
while (S.size() > n - i) {
auto it = S.begin();
ans -= *it, S.erase(it);
}
}
printf("%lld\n", ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
// #define endl '\n'
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define rf(i,a,b) for(int i=a;i>=b;i--)
#define fast_io ios_base::sync_with_stdio(0);
#define show(x) cout<<x<<endl;
#define pret(x) cout<<x<<endl; return 0;
#define disp(x) cout<<x<<" ";
#define let(x,y) cout<<x<<" "<<y<<endl;
ll MOD=1e9+7;
const int maxn=2e5+5;
int solve(){
int n;
cin>>n;
int ans = 0;
vi v[n],g[n];
for (int i = 0; i < n; ++i)
{
int k,l,r;
cin>>k>>l>>r;
k--;
if(l >= r){
ans += r;
v[k].emplace_back(l-r);
}
else{
ans += l;
if(n-k-2 >= 0) g[n-k-2].emplace_back(r-l);
}
}
multiset<int>s;
for (int i = 0; i < n; ++i)
{
for(const auto it:v[i]){
s.insert(it);
}
while(s.size() > (i+1)){
s.erase(s.begin());
}
}
for(auto it:s) ans += it;
// show(ans);
s.clear();
for (int i = 0; i < n; ++i)
{
for(const auto it:g[i]){
s.insert(it);
}
while(s.size() > (i+1)){
s.erase(s.begin());
}
}
for(auto it:s) ans += it;
return ans;
}
int32_t main(){
fast_io;
int t;
cin>>t;
while(t--){
show(solve());
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
int t;
cin >> t;
for(int i=0; i<t; ++i){
int n;
cin >> n;
priority_queue<P> que1;
priority_queue<P> que2;
ll ans = 0;
for(int i=0; i<n; ++i){
int k, l, r;
cin >> k >> l >> r;
if(l == r) ans += l;
else if(l > r){
que1.push(make_pair(k,l-r));
ans += r;
}else{
que2.push(make_pair(n-k,r-l));
ans += l;
}
}
//cout << "minans" << ans << endl;
int n1 = que1.size();
priority_queue<int> que3;
for(int i=n1; i>0; --i){
while(!que1.empty() && que1.top().first >= i){
que3.push(que1.top().second);
que1.pop();
}
if(!que3.empty()){
ans += que3.top();
que3.pop();
}
}
int n2 = que2.size();
//cout << n1 << " " << n2 << endl;
priority_queue<int> que4;
for(int i=n2; i>0; --i){
while(!que2.empty() && que2.top().first >= i){
que4.push(que2.top().second);
que2.pop();
}
if(!que4.empty()){
ans += que4.top();
que4.pop();
}
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int T;
cin >> T;
while(T--){
int n,ans=0;
cin >> n;
vector <pair <int,int> > l,r;
for(int i=0;i<n;i++){
int k,a,b;
cin >> k >> a >> b;
if(a>b){
ans+=b,a-=b;
l.push_back({a,k});
}
else{
ans+=a,b-=a;
r.push_back({b,k+1});
}
}
sort(l.rbegin(),l.rend());
sort(r.rbegin(),r.rend());
set <int> sl,sr;
for(int i=1;i<=(int)l.size();i++)
sl.insert(i);
for(int i=0;i<(int)r.size();i++)
sr.insert(n-i);
for(auto [k,i]:l){
auto it=sl.upper_bound(i);
if(it==sl.begin())continue;
it--;
ans+=k;
sl.erase(it);
}
for(auto [k,i]:r){
auto it=sr.lower_bound(i);
if(it==sr.end())continue;
ans+=k;
sr.erase(it);
}
cout << ans << '\n';
}
} |
#include<bits/stdc++.h>
using namespace std;
#define IN inline
#define CO const
typedef long long int64;
template<class T> IN T read(){
T x=0,w=1;char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-') w=-w;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
return x*w;
}
template<class T> IN T read(T&x){
return x=read<T>();
}
CO int N=2e5+10;
int K[N],L[N],R[N];
void real_main(){
int n=read<int>();
vector<int> F,G;
int64 ans=0;
for(int i=1;i<=n;++i){
read(K[i]),read(L[i]),read(R[i]);
ans+=min(L[i],R[i]);
if(L[i]>R[i]) F.push_back(i);
else if(L[i]<R[i]) G.push_back(i);
}
sort(F.begin(),F.end(),[&](int a,int b)->bool{
return K[a]<K[b];
});
priority_queue<int,vector<int>,greater<int> > heap;
for(int i:F){
if((int)heap.size()<K[i]){
ans+=L[i]-R[i];
heap.push(L[i]-R[i]);
}
else if(heap.size() and heap.top()<L[i]-R[i]){
ans+=L[i]-R[i]-heap.top();
heap.pop(),heap.push(L[i]-R[i]);
}
}
sort(G.begin(),G.end(),[&](int a,int b)->bool{
return n-K[a]<n-K[b];
});
while(heap.size()) heap.pop();
for(int i:G){
if((int)heap.size()<n-K[i]){
ans+=R[i]-L[i];
heap.push(R[i]-L[i]);
}
else if(heap.size() and heap.top()<R[i]-L[i]){
ans+=R[i]-L[i]-heap.top();
heap.pop(),heap.push(R[i]-L[i]);
}
}
printf("%lld\n",ans);
}
int main(){
for(int T=read<int>();T--;) real_main();
return 0;
}
|
#include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Tue Jul 21 18:31:19 JST 2020
**/
void solve() {
Int n;
std::cin >> n;
std::vector<std::vector<Int>> bl(n), br(n);
Int ans = 0;
REP(i, n) {
Int k, l, r;
std::cin >> k >> l >> r, k--;
ans += std::min(l, r);
if (l > r) {
bl[k].push_back(l - r);
} else {
if (n - 2 - k >= 0) br[n - 2 - k].push_back(r - l);
}
}
for (auto& v : {bl, br}) {
std::priority_queue<Int, std::vector<Int>, std::greater<Int>> pq;
REP(i, n) {
for (Int x : v[i]) pq.push(x);
while (pq.size() > i + 1) pq.pop();
}
while (pq.size()) ans += pq.top(), pq.pop();
}
std::cout << ans << "\n";
}
signed main() {
Int T;
std::cin >> T;
while (T--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = 1e9 + 1;
void solve() {
int n;
cin >> n;
vector<vector<ll>> a(n + 1), b(n + 1);
ll s = 0;
for (int i = 0; i < n; i++) {
ll k, l, r;
cin >> k >> l >> r;
if (l >= r) {
a[k - 1].push_back(l - r);
s += r;
} else {
b[k].push_back(r - l);
s += l;
}
}
vector<ll> v(n, INF);
{
priority_queue<ll> q;
for (int i = n - 1; i >= 0; i--) {
for (auto e : a[i]) q.push(e);
if (v[i] == INF && !q.empty()) {
v[i] = q.top();
q.pop();
}
}
}
sort(v.begin(), v.end());
{
priority_queue<ll> q;
for (int i = 0; i < n; i++) {
for (auto e : b[i]) q.push(e);
if (v[i] == INF && !q.empty()) {
v[i] = q.top();
q.pop();
}
}
}
for (auto e : v) {
if (e != INF) s += e;
}
cout << s << endl;
}
int main() {
int t;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int N;
cin >> N;
vector<vector<int>> L(N), R(N);
int64_t res = 0;
for (int i = 0; i < N; i++) {
int k, l, r;
cin >> k >> l >> r;
res += min(l, r);
k--;
if (l > r) {
L[k].emplace_back(abs(l - r));
} else {
if (k + 1 < N) R[k + 1].emplace_back(abs(l - r));
}
}
priority_queue<int, vector<int>, greater<int>> que;
for (int i = 0; i < N; i++) {
if (!L[i].empty()) {
for (auto x : L[i]) {
que.push(x);
}
}
while ((int)que.size() > i + 1) {
que.pop();
}
}
while (!que.empty()) {
res += que.top();
que.pop();
}
for (int i = N - 1; i > -1; i--) {
if (!R[i].empty()) {
for (auto x : R[i]) {
que.push(x);
}
}
while ((int)que.size() > N - i) {
que.pop();
}
}
while (!que.empty()) {
res += que.top();
que.pop();
}
cout << res << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
for (int i = 0; i < T; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
using P = pair<ll,ll>;
int main(){
int t;
cin >> t;
vector<ll> ans(t);
rep(x,t) {
ll n, k, l, r;
cin >> n;
vector<P> plus, minus;
rep(i,n) {
cin >> k >> l >> r;
ans[x] += r;
if(l-r > 0) plus.push_back(P(k,l-r));
else if(l-r < 0 && k < n) {
ans[x] += l - r;
minus.push_back(P(n-k,r-l));
}
else ans[x] += l-r;
}
sort(plus.begin(),plus.end());
sort(minus.begin(),minus.end());
priority_queue<ll,vector<ll>,greater<ll>> que;
for(P p : plus) {
que.push(p.second);
while(que.size() > p.first) {
que.pop();
}
}
while(que.size()) {
ans[x] += que.top();
que.pop();
}
for(P m : minus) {
que.push(m.second);
while(que.size() > m.first) {
que.pop();
}
}
while(que.size()) {
ans[x] += que.top();
que.pop();
}
}
rep(i,t) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mk make_pair
const int N=200010;
int n, m;
vector<pair<int, pair<int, int>> > v[N], v1[N];
int main(){
int t;
cin>>t;
while(t--){
scanf("%d",&n);
int k, l, r;
ll ans=0;
for(int i=0; i<=n+1; ++i){
v[i].clear();
v1[i].clear();
}
multiset<pair<int, pair<int, int>>>s;
for(int i=0; i<n; ++i){
scanf("%d%d%d",&k,&l,&r);
if(r>=l){
v1[k+1].push_back(mk(-(r-l), mk(-r, -l)));
}
else{
v[k].push_back(mk(-(l-r), mk(-l, -r)));
}
}
for(int i=n; i>=1; --i){
for(auto it:v[i])s.insert(it);
if(s.size()>0){
ans-=s.begin()->second.first;
s.erase(s.begin());
}
}
while(s.size()>0){
ans-=s.begin()->second.second;
s.erase(s.begin());
}
for(int i=1; i<=n; ++i){
for(auto it:v1[i])s.insert(it);
if(s.size()>0){
ans-=s.begin()->second.first;
s.erase(s.begin());
}
}
while(s.size()>0){
ans-=s.begin()->second.second;
s.erase(s.begin());
}
for(auto it:v1[n+1])ans-=it.second.second;
for(auto it:v[0])ans-=it.second.second;
printf("%lld\n",ans);
}
} |
#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<ll, ll>> a)
{
ll N = a.size();
for (auto &p : a)
p.first = min(p.first, N);
vector<vector<ll>> v(N + 1);
for (auto &p : a)
v[p.first].push_back(p.second);
priority_queue<ll> pq;
ll res = 0;
for (int i = N; i > 0; i--)
{
for (auto k : v[i])
pq.push(k);
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<ll, 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);
if (l > r)
left.emplace_back(k, l - r);
if (r > l)
right.emplace_back(N - k, r - l);
}
ans += cost(left);
ans += cost(right);
cout << ans << "\n";
}
} |
#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 i = 0; i < N; i++) {
for (auto k : K[i]) {
if (k.first > k.second) que.push(k.first - k.second);
}
while ((int)que.size() > i + 1) {
que.pop();
}
}
while (!que.empty()) {
res += que.top();
que.pop();
}
for (int i = N - 1; i > -1; i--) {
for (auto k : K[i]) {
if (k.second > k.first) que.push(k.second - k.first);
}
while ((int)que.size() > N - i - 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int t;
cin >> t;
for(int i=0;i<t;i++){
ll n,ans=0;
cin >> n;
vector<ll>k(n),l(n),r(n);
vector<pair<int,int>> a,b;
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]){
a.push_back(make_pair(k[i],(l[i]-r[i])));
}
else{
b.push_back(make_pair((n-k[i]),(r[i]-l[i])));
}
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
priority_queue<ll,vector<ll>,greater<ll>>lpq,rpq;
for(int i=0;i<a.size();i++){
lpq.push(a[i].second);
while(a[i].first<lpq.size()){
lpq.pop();
}
}
while(lpq.size()){
ans+=lpq.top();
lpq.pop();
}
for(int i=0;i<b.size();i++){
rpq.push(b[i].second);
while(b[i].first<rpq.size()){
rpq.pop();
}
}
while(rpq.size()){
ans+=rpq.top();
rpq.pop();
}
cout << ans << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(vector<pair<int,int>>& t)
{
sort(t.begin(),t.end(),greater<pair<int,int>>());
priority_queue<int> pq;
ll res=0;
for(int i=(int)t.size(),j=0;i>0;i--)
{
while(j<(int)t.size() && t[j].first>=i)
pq.push(t[j++].second);
if(!pq.empty())
res+=pq.top(),pq.pop();
}
return res;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
ll base=0;
vector<pair<int,int>> tl,tr;
for(int i=1;i<=n;i++)
{
int k,l,r;
scanf("%d%d%d",&k,&l,&r);
if(l>r)tl.push_back({k,l-r}),base+=r;
else tr.push_back({n-k,r-l}),base+=l;
}
printf("%lld\n",base+solve(tl)+solve(tr));
}
return 0;
}
|
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a-MOD);
}
std::vector<ll> v[225816][2];
std::priority_queue<ll, std::vector<ll>, std::greater<ll> > pq;
int main(void){
int n,i,j,k,m[2],t,c;
ll l,r,ans=0ll;
std::cin >> c;
while(c--){
ans = 0ll;
m[0] = 0; m[1] = 0;
std::cin >> n;
for(i=0; i<n; ++i){
std::cin >> k >> l >> r;
v[k][l<r].push_back(abs(r-l));
ans += std::min(l,r);
++m[l<r];
}
for(k=0; k<2; ++k){
for(i=1; i<=m[k]; ++i){
t = (k?(n-i):i);
for(j=0; j<v[t][k].l_ength(); ++j){
pq.push(v[t][k][j]);
}
while(pq.size()>i){
pq.pop();
}
}
while(!pq.empty()){
ans += pq.top();
pq.pop();
}
for(i=m[k]+1; i<=n; ++i){
t = (k?(n-i):i);
for(j=0; j<v[t][k].l_ength(); ++j){
ans += v[t][k][j];
}
}
}
for(i=0; i<=n; ++i){
for(k=0; k<2; ++k){
v[i][k].clear();
}
}
std::cout << ans << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
ll calc(const vector<pair<int,int>>& v){
ll ret = 0;
priority_queue<int> que;
int j = 0;
for(int i=v.size()-1; i>=0; i--){
while(j<v.size() && v[j].first >= i){
que.push(v[j].second);
j++;
}
if(!que.empty()){
ret += que.top();
que.pop();
}
}
return ret;
}
void solve(){
int N;
cin >> N;
vector<pair<int,int>> lhs, rhs;
ll sum = 0;
rep(i,N){
int k, l, r;
cin >> k >> l >> r;
k--;
int mn = min(l, r);
sum += mn;
l -= mn;
r -= mn;
if(l > 0){
lhs.emplace_back(k,l);
}else{
rhs.emplace_back(N-1-(k+1),r);
}
}
sort(ALLOF(lhs));
reverse(ALLOF(lhs));
sort(ALLOF(rhs));
reverse(ALLOF(rhs));
sum += calc(lhs);
sum += calc(rhs);
cout << sum << endl;
}
int main(){
int T;
cin >> T;
rep(t,T){
solve();
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
void solve(){
int n;
cin >> n;
ll ans = 0;
vector<pair<int, int>> A, B;
for (int i = 0; i < n; ++i) {
int k, l, r;
cin >> k >> l >> r;
ans += max(l, r);
if(l > r) A.emplace_back(k, l-r);
else B.emplace_back(n-k, r-l);
}
sort(A.begin(),A.end());
sort(B.begin(),B.end());
GPQ<int> s;
for (auto &&e : A) {
s.emplace(e.second);
while(s.size() > e.first){
ans -= s.top();
s.pop();
}
}
while(!s.empty()) s.pop();
for (auto &&e : B) {
s.emplace(e.second);
while(s.size() > e.first){
ans -= s.top();
s.pop();
}
}
cout << ans << "\n";
}
int main() {
int t;
cin >> t;
while(t--){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1e9+5;
const int N=1000+10;
const ll mod=1e9+7;
struct camel{
int k,l,r;
};
bool cmp(const camel& a,const camel& b){
return a.k<b.k;
}
ll calc(vector<camel> a){
ll minSum=0;
int n=(int)a.size();
sort(all(a),cmp);
multiset<int> MS;
for(int i=0;i<n;++i){
int pos=a[i].k;
MS.insert(a[i].l-a[i].r);
while(pos<(int)MS.size()){
auto it=MS.begin();
minSum+=*it;
MS.erase(it);
}
}
return minSum;
}
void solve(){
int n;
ll ans=0;
cin>>n;
vector<camel> inFront,inBack;
vector<camel> a(n);
for(int i=0;i<n;++i){
cin>>a[i].k>>a[i].l>>a[i].r;
if(a[i].l>a[i].r){
ans+=a[i].l;
inFront.push_back(a[i]);
}
else{
swap(a[i].l,a[i].r);
ans+=a[i].l;
a[i].k=n-a[i].k;
inBack.push_back(a[i]);
}
}
ans-=calc(inFront);
ans-=calc(inBack);
cout<<ans<<endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--) solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int T,n,k,l,r;
long long ans;
vector<pair<int,int>>a,b;
multiset<int>s;
void sol(vector<pair<int,int>>&v)
{
sort(v.begin(),v.end());
s.clear();
for(auto x:v)
{
s.insert(x.second);
ans+=x.second;
while(s.size()>x.first)
{
ans-=*s.begin();
s.erase(s.begin());
}
}
}
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
ans=0;
a.clear(),b.clear();
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&k,&l,&r);
if(l>r)
a.emplace_back(k,l-r);
else if(l<r)
b.emplace_back(n-k,r-l);
ans+=min(l,r);
}
sol(a),sol(b);
printf("%lld\n",ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int t, n, ki, li, ri;
int main(){
scanf("%d", &t);
while(t--){
scanf("%d", &n);
long long res = 0;
int m = 0;
vector < pair <int, int> > vx, vy;
for(int i = 0; i < n; i++){
scanf("%d %d %d", &ki, &li, &ri);
if(li == ri)res += li;
else if(li > ri){
m++;
res += ri;
vx.push_back(make_pair(ki - 1, li - ri));
}else{
res += li;
vy.push_back(make_pair(ki, ri - li));
}
}
sort(vx.rbegin(), vx.rend());
sort(vy.begin(), vy.end());
multiset <int> s;
for(int i = m - 1, j = 0; i >= 0; i--){
while(j < (int)vx.size() && vx[j].first >= i){
s.insert(vx[j].second);
j++;
}
if(!s.empty()){
res += *prev(s.end());
s.erase(prev(s.end()));
}
}
s.clear();
for(int i = m, j = 0; i < n; i++){
while(j < (int)vy.size() && vy[j].first <= i){
s.insert(vy[j].second);
j++;
}
if(!s.empty()){
res += *prev(s.end());
s.erase(prev(s.end()));
}
}
printf("%lld\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll,ll,ll> tlll;
int main() {
int T; cin >> T;
while (T--) {
int N; cin >> N;
ll ans = 0;
vector<vector<int>> vl(N+1);
vector<vector<int>> vr(N+1);
for (int i = 0; i < N; ++i) {
ll k, l, r; cin >> k >> l >> r;
if (l > r) {
ans += r;
vl[k].push_back(l-r);
} else if (l < r) {
ans += l;
vr[k].push_back(r-l);
} else {
ans += l;
}
}
priority_queue<int, vector<int>, greater<int>> pl;
for (int i = 1; i <= N; ++i) {
for (int x : vl[i]) {
pl.push(x);
}
while (pl.size() > i) pl.pop();
}
while (!pl.empty()) {
ans += pl.top();
pl.pop();
}
priority_queue<int, vector<int>, greater<int>> pr;
for (int i = N; 1 <= i; --i) {
for (int x : vr[i]) {
pr.push(x);
}
while (pr.size() > N-i) pr.pop();
}
while (!pr.empty()) {
ans += pr.top();
pr.pop();
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<pair<int,int>> pos, neg;
long long sum = 0;
for (int i = 0; i < n; i++) {
int k, l, r;
cin >> k >> l >> r;
if (l > r) {
pos.emplace_back(k, l - r);
} else {
neg.emplace_back(n - k, r - l);
}
sum += min(l, r);
}
{
sort(pos.begin(), pos.end());
multiset<int> q;
int k, v;
for (auto c : pos) {
tie(k, v) = c;
q.insert(v);
if (q.size() > k) q.erase(q.begin());
}
for (auto v : q) sum += v;
}
{
sort(neg.begin(), neg.end());
multiset<int> q;
int k, v;
for (auto c : neg) {
tie(k, v) = c;
q.insert(v);
if (q.size() > k) q.erase(q.begin());
}
for (auto v : q) sum += v;
}
cout << sum << '\n';
return;
}
int main() {
ios_base::sync_with_stdio(false);
int tt;
cin >> tt;
while (tt--) {
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int n;ll sum;
inline void solve(){
vector<pii>v1,v2;
set<int>s1,s2;
cin>>n;sum=0;
for(int i=1,l,r,k;i<=n;++i){
cin>>k>>l>>r;sum+=r;
if(l>r)v1.push_back({l-r,k});
else v2.push_back({l-r,k});
}
for(int i=1;i<=v1.size();++i)s1.insert(i);
for(int i=v1.size()+1;i<=n;++i)s2.insert(i);
sort(v1.rbegin(),v1.rend());
sort(v2.begin(),v2.end());
for(pii p:v1){
auto it=s1.upper_bound(p.second);
if(it!=s1.begin()){
--it;
s1.erase(it);
sum+=p.first;
}
}
for(pii p:v2){
auto it=s2.upper_bound(p.second);
if(it==s2.end())sum+=p.first;
else s2.erase(it);
}
cout<<sum<<'\n';
}
int main(){
ios_base::sync_with_stdio(false);
int T;cin>>T;
for(;T--;)solve();
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
int N;
ll calc(vector<pair<int, ll>> &v){
sort(all(v));
int sz = v.size();
ll res = 0;
priority_queue<ll> pq;
int idx = sz-1;
for(int i = N - 1; i >= 0; i--){
while(idx >= 0 && v[idx].first == i){
pq.push(v[idx].second);
idx--;
}
if(pq.empty())continue;
res += pq.top();
pq.pop();
}
return res;
}
void solve(){
cin >> N;
vector<pair<int, ll>> lefts, rights;
ll base = 0;
rep(i,N){
int K;
ll L, R;
cin >> K >> L >> R;
K--;
ll minn = min(L, R);
base += minn;
L -= minn;
R -= minn;
if(L == R)continue;
if(L > R)lefts.emplace_back(K, L);
if(L < R){
K++;
rights.emplace_back(N-1-K, R);
}
}
cout << base + calc(lefts) + calc(rights) << 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;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--) {
int n; cin >> n;
vector<vector<vector<int>>> f(2, vector<vector<int>>(n + 1));
ll sum = 0;
for (int i = 0; i < n; ++i) {
int k, l, r; cin >> k >> l >> r;
if (l >= r) {
f[0][k].emplace_back(r - l);
sum += l;
}
else {
if (n - k == 0) {
sum += l;
continue;
}
f[1][n - k].emplace_back(l - r);
sum += r;
}
}
for (int j = 0; j < 2; ++j) {
priority_queue<int> pq;
for (int i = 1; i <= n; ++i) {
for (auto p : f[j][i]) pq.emplace(p);
while (pq.size() > i) {
sum += pq.top();
pq.pop();
}
}
}
cout << sum << '\n';
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mk make_pair
const int N=200010;
int n, m;
vector<pair<int, pair<int, int>> > v[N], v1[N];
int main(){
int t;
cin>>t;
while(t--){
scanf("%d",&n);
int k, l, r;
ll ans=0;
for(int i=0; i<=n+1; ++i){
v[i].clear();
v1[i].clear();
}
multiset<pair<int, pair<int, int>>>s;
for(int i=0; i<n; ++i){
scanf("%d%d%d",&k,&l,&r);
if(r>=l){
v1[k+1].push_back(mk(-(r-l), mk(-r, -l)));
}
else{
v[k].push_back(mk(-(l-r), mk(-l, -r)));
}
}
for(int i=n; i>=1; --i){
for(auto it:v[i])s.insert(it);
if(s.size()>0){
ans-=s.begin()->second.first;
s.erase(s.begin());
}
}
while(s.size()>0){
ans-=s.begin()->second.second;
s.erase(s.begin());
}
for(int i=1; i<=n; ++i){
for(auto it:v1[i])s.insert(it);
if(s.size()>0){
ans-=s.begin()->second.first;
s.erase(s.begin());
}
}
while(s.size()>0){
ans-=s.begin()->second.second;
s.erase(s.begin());
}
for(auto it:v1[n+1])ans-=it.second.second;
printf("%lld\n",ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast_cin() ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl '\n'
#define int long long
const int N = 2e5 + 5;
vector<int> g[2][N];
void testcase() {
int n; cin >> n;
int ans = 0;
for (int i = 0; i < n; ++i) {
int k, l, r; cin >> k >> l >> r;
if (l >= r) {
g[0][k].push_back(l - r);
} else {
g[1][n - k].push_back({r - l});
}
ans += min(l, r);
}
for (int u : {0, 1}) {
multiset<int> now;
for (int k = 1; k <= n; ++k) {
for (int &profit : g[u][k]) {
now.insert(profit);
ans += profit;
}
while ((int)now.size() > k) {
ans -= *now.begin();
now.erase(now.find(*now.begin()));
}
}
}
cout << ans << endl;
for (int i = 1; i <= n; ++i) {
g[0][i].clear(), g[1][i].clear();
}
}
int32_t main() {
fast_cin();
int T; cin >> T;
while (T--) {
testcase();
}
return 0;
} |
#include<algorithm>
#include<stack>
#include<ctime>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<queue>
using namespace std;
typedef int _int;
#define int long long
inline int read(){
int num=0,f=1;char x=getchar();
while(x<'0'||x>'9'){if(x=='-')f=-1;x=getchar();}
while(x>='0'&&x<='9'){num=num*10+x-'0';x=getchar();}
return num*f;
}
const int maxn=200005;
struct point{
int k,d;
}p[maxn],a[maxn],b[maxn];
priority_queue<int, vector<int>, greater<int> > pq;
int n,cnt1,cnt2;
bool cmp1(point a,point b){
return a.k<b.k;
}
bool cmp2(point a,point b){
return a.k>b.k;
}
_int main(){
int T=read();
while(T--){
n=read();
int ans=0;cnt1=cnt2=0;
for(int i=1,l,r;i<=n;++i){
p[i].k=read();l=read();r=read();
p[i].d=l-r;
if(l-r>0){
ans+=r;
a[++cnt1]=p[i];
}
else {
ans+=l;
b[++cnt2]=p[i];
b[cnt2].d=-b[cnt2].d;
}
}
sort(a+1,a+cnt1+1,cmp1);
sort(b+1,b+cnt2+1,cmp2);
for(int i=1;i<=cnt1;++i){
pq.push(a[i].d);
if(pq.size()>a[i].k)pq.pop();
}
while(pq.size()){ans+=pq.top();pq.pop();}
for(int i=1;i<=cnt2;++i){
pq.push(b[i].d);
if(pq.size()>n-b[i].k)pq.pop();
}
while(pq.size()){ans+=pq.top();pq.pop();}
printf("%lld\n",ans);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
for(int i=0;i<t;i++){
int n;
cin >> n;
long long int ans=0;
vector<pair<int,long long int> > left;
vector<pair<int,long long int> > right;
for(int j=0;j<n;j++){
int k;
long long int l,r;
cin >> k >> l >> r;
k;
if(l>r){
ans+=r;
left.emplace_back(k,l-r);
}
else if(r>l){
ans+=l;
right.emplace_back(n-k,r-l);
}
else ans+=l;
}
sort(left.begin(),left.end());
sort(right.begin(),right.end());
priority_queue<long long int,vector<long long int>,greater<long long int>> q;
for(auto u:left){
q.emplace(u.second);
ans+=u.second;
while(q.size()>u.first) ans-=q.top(), q.pop();//小さいモノからあきらめていくスタイル
}
while(!q.empty())q.pop();
for(auto u:right){
q.emplace(u.second);
ans+=u.second;
while(q.size()>u.first) ans-=q.top(), q.pop();
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t solve() {
int n = ri();
int64_t base = 0;
std::vector<int> first[n];
std::vector<int> second[n];
int first_cnt = 0;
int second_cnt = 0;
for (int i = 0; i < n; i++) {
int k = ri();
int l = ri();
int r = ri();
if (k == n || l == r) base += l;
else if (l > r) {
base += r;
first[k].push_back(l - r);
first_cnt++;
} else {
base += l;
second[k].push_back(r - l);
second_cnt++;
}
}
int64_t r0 = 0;
std::multiset<int> all;
for (int i = n - 1; i >= 0; i--) {
if (all.size() && i < first_cnt) r0 += *std::prev(all.end()), all.erase(std::prev(all.end()));
for (auto j : first[i]) all.insert(j);
}
all.clear();
int64_t r1 = 0;
for (int i = 0; i < n; i++) {
for (auto j : second[i]) all.insert(j);
if (all.size() && i >= n - second_cnt) r1 += *std::prev(all.end()), all.erase(std::prev(all.end()));
}
return base + r0 + r1;
}
int main() {
int t = ri();
for (int i = 0; i < t; i++) printf("%" PRId64 "\n", solve());
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
template<class T> inline bool chmin(T &a, T b){
if(a>b){a=b;return true;}
return false;
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){a=b;return true;}
return false;
}
constexpr int mod = 1e9+7;
constexpr int inf = 3e18;
int N;
void solve(){
cin>>N;
vector<P>Front,Back;
int ans=0;
rep(i,N){
int K,L,R;cin>>K>>L>>R;
if(L>=R){
ans+=L;
Front.push_back({K-1,L-R});
}else {
ans+=R;
Back.push_back({N-K,R-L});
}
}
sort(all(Front));sort(all(Back));
priority_queue<int,vector<int>,greater<int>>que;
int Index=0;
rep(i,N){
while(Index<len(Front)&&Front[Index].first<=i)
que.push(Front[Index++].second);
while(len(que)>i+1){
ans-=que.top();que.pop();
}
}
while(len(que))que.pop();
Index=0;
rep(i,N){
while(Index<len(Back)&&Back[Index].first<=i)
que.push(Back[Index++].second);
while(len(que)>i){
ans-=que.top();que.pop();
}
}
cout<<ans<<"\n";
}
signed main(){
int T;
cin>>T;
while(T--)solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin>>T;
for(int i=0;i<T;i++){
int N;
int64_t Z=0;
cin>>N;
vector<pair<int,int64_t>> l;
vector<pair<int,int64_t>> r;
for(int i=0;i<N;i++){
int a;
int64_t b,c;
cin>>a>>b>>c;
if(b>c){
Z+=c;
l.push_back(make_pair(a,b-c));
}
else if(c>b&&a!=N){
Z+=b;
r.push_back(make_pair(N-a,c-b));
}
else{
Z+=b;
}
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
priority_queue<int64_t, vector<int64_t>, greater<int64_t>> pq;
for(auto x:l){
int a;
int64_t b;
tie(a,b)=x;
pq.push(b);
if(a<pq.size()){
pq.pop();
}
}
while(!pq.empty()){
Z+=pq.top();
pq.pop();
}
for(auto x:r){
int a;
int64_t b;
tie(a,b)=x;
pq.push(b);
if(a<pq.size()){
pq.pop();
}
}
while(!pq.empty()){
Z+=pq.top();
pq.pop();
}
cout<<Z<<endl;
}
} |
#include<iostream>
#include<algorithm>
#include<iterator>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int main()
{
int t,n,k,l,r,tt,i;
ll res;
vector<int> e;
vector<P> p;
decltype(e)::iterator it;
cin >> t;
for(tt=0;tt<t;tt++){
cin >> n;
res=0;
e.clear();
p.clear();
for(i=0;i<n;i++){
cin >> k >> l >> r;
res+=r;
p.emplace_back(l-r,k-1);
}
sort(p.begin(),p.end(),greater<P>());
for(i=0;i<n;i++){
if(p[i].first<=0)
break;
e.push_back(i);
}
for(i=0;i<n;i++){
if(p[i].first<=0)
break;
it=upper_bound(e.begin(),e.end(),p[i].second);
if(it==e.begin()){
continue;
}
e.erase(prev(it));
res+=p[i].first;
}
e.clear();
for(i=n-1;i>=0;i--){
if(p[i].first>=0)
break;
e.push_back(i);
}
for(i=n-1;i>=0;i--){
if(p[i].first>=0)
break;
it=upper_bound(e.begin(),e.end(),p[i].second+1,greater<int>());
if(it==e.begin()){
res+=p[i].first;
continue;
}
e.erase(prev(it));
}
cout << res << 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++)
vector<ll> ans;
void solve() {
int n;
cin >> n;
ll res = 0;
vector<ll> lefters[n], righters[n+1];
rep(i, n) {
ll k, l, r;
cin >> k >> l >> r;
k--;
res += 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()) {
res += pql.top();
pql.pop();
}
while (!pqr.empty()) {
res += pqr.top();
pqr.pop();
}
ans.push_back(res);
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
for(ll a : ans){
cout << a << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793238462
typedef long long ll;
typedef double db;
vector<ll> p[200005],c[200005];
int main(){
int o;cin>>o;
while(o--){
ll n,ans=0;cin>>n;
priority_queue<ll,vector<ll>,greater<ll>> q;
for(int i=1;i<=n;i++){
p[i].clear();c[i].clear();
}
for(ll i=1;i<=n;i++){
ll k,l,r;cin>>k>>l>>r;
if(l>r) p[k].push_back(l-r),ans+=r;
if(l<r) c[n-k].push_back(r-l),ans+=l;
if(l==r) ans+=l;
}
for(int i=1;i<=n;i++){
for(auto j:p[i]){
q.push(j);
}
while(q.size()>i){
q.pop();
}
}
while(q.size()){
ans+=q.top();q.pop();
}
for(int i=1;i<=n;i++){
for(auto j:c[i]){
q.push(j);
}
while(q.size()>i){
q.pop();
}
}
while(q.size()){
ans+=q.top();q.pop();
}
cout<<ans<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(vector<pair<int, int>> &a) {
int n = a.size();
vector<vector<int>> events(n + 1);
for (auto [when, x] : a) {
events[min(when, n)].push_back(x);
}
priority_queue<int> pq;
ll res = 0;
for (int i = n; i; i--) {
for (auto el : events[i]) {
pq.push(el);
}
if (pq.size()) {
res += pq.top();
pq.pop();
}
}
return res;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
array<vector<pair<int, int>>, 2> want;
ll ans = 0;
for (int i = 0; i < n; i++) {
int t, L, R;
cin >> t >> L >> R;
ans += min(L, R);
want[L >= R].emplace_back(L >= R ? t : n - t, max(L, R) - min(L, R));
}
cout << ans + solve(want[0]) + solve(want[1]) << '\n';
}
} |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll check(vector<pair<ll,ll>> vt){
ll n = vt.size();
for(int i=0;i<n;i++) vt[i].first=min(vt[i].first,n);
vector<vector<ll>> vs(n+1);
for(int i=0;i<n;i++) vs[vt[i].first].emplace_back(vt[i].second);
priority_queue<ll> que;
ll ans=0;
for(int i=n;i>0;i--){
for(auto u:vs[i]){
que.push(u);
}
if(!que.empty()){
ans+=que.top();
que.pop();
}
}
return ans;
}
void solve(){
int n;
cin >> n;
ll k,l,r;
ll ans = 0;
vector<pair<ll,ll>> right,left;
ll m;
for(int i=0;i<n;i++){
cin >> k >> l >> r;
if(l>r){
ans+=r;
left.emplace_back(k,l-r);
}else{
ans+=l;
right.emplace_back(n-k,r-l);
}
}
ans+=check(left);
ans+=check(right);
cout << ans << endl;
}
int main(){
ll t;
cin >> t;
for(ll i=0;i<t;i++){
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
struct tp
{
ll l, r, k;
};
tp a[200010];
vector <tp> v1, v2;
bool cmp1(tp a, tp b)
{
return a.k<b.k;
}
bool cmp2(tp a, tp b)
{
return a.k>b.k;
}
int main()
{
ll i, j, k, n, m, t;
scanf("%lld", &t);
while(t--)
{
scanf("%lld", &n);
v1.clear();
v2.clear();
for(i=0; i<n; i++)
{
scanf("%lld %lld %lld", &a[i].k, &a[i].l, &a[i].r);
//cout<<i<<endl;
if(a[i].l>=a[i].r) v1.push_back(a[i]);
else v2.push_back(a[i]);
}
sort(v1.begin(), v1.end(), cmp1);
ll sz=v1.size(), cnt=1;
priority_queue <ll> pq;
ll res=0;
//cout<<"*"<<endl;
for(i=0; i<sz; i++)
{
res+=v1[i].l;
if(v1[i].k>=cnt)
{
cnt++;
pq.push(v1[i].r-v1[i].l);
}
else
{
pq.push(v1[i].r-v1[i].l);
ll x=pq.top();
pq.pop();
res+=x;
}
}
while(pq.size()) pq.pop();
sort(v2.begin(), v2.end(), cmp2);
cnt=n;
sz=v2.size();
for(i=0; i<sz; i++)
{
res+=v2[i].r;
if(v2[i].k<cnt)
{
cnt--;
pq.push(v2[i].l-v2[i].r);
}
else
{
pq.push(v2[i].l-v2[i].r);
ll x=pq.top();
pq.pop();
res+=x;
}
}
while(pq.size()) pq.pop();
printf("%lld\n", res);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
struct node {
ll l,r,k;
};
bool cmp(node &p, node &q) {
return p.k < q.k;
}
int main() {
ll t;
cin>>t;
while(t--) {
ll n;
cin>>n;
ll i,ans=0,ind1=0,ind2=0;
node p[n+1],q[n+1];
for(i=1;i<=n;i++) {
ll l,r,k;
cin>>k>>l>>r;
ans += min(l,r);
if(l>r) {
p[ind1].l=l;
p[ind1].r=r;
p[ind1].k=k;
ind1++;
}
else {
q[ind2].l=l;
q[ind2].r=r;
q[ind2].k=n-k;
ind2++;
}
}
// cout<<ind1<<" "<<ind2<<"\n";
sort(p, p+ind1, cmp);
sort(q, q+ind2, cmp);
priority_queue<ll, vector<ll>, greater<ll>> pq1, pq2;
for(i=0;i<ind1;i++) {
if(p[i].k == 0)
continue;
else if(p[i].k > pq1.size())
pq1.push(p[i].l - p[i].r);
else if(p[i].k == pq1.size() && pq1.top()<(p[i].l-p[i].r)) {
pq1.pop();
pq1.push(p[i].l-p[i].r);
}
}
for(i=0;i<ind2;i++) {
if(q[i].k == 0)
continue;
else if(q[i].k > pq2.size())
pq2.push(q[i].r - q[i].l);
else if(q[i].k == pq2.size() && pq2.top()<(q[i].r-q[i].l)) {
pq2.pop();
pq2.push(q[i].r-q[i].l);
}
}
while(!pq1.empty()) {
ans += pq1.top();
pq1.pop();
}
while(!pq2.empty()) {
ans += pq2.top();
pq2.pop();
}
cout<<ans<<"\n";
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+5;
struct C{
int k,l,r;
bool operator <(const C &b)const{return abs(l-r)>abs(b.l-b.r);}
}a[N];
set<int>S,S1;
void work(){
int n,n1=0;scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d%d%d",&a[i].k,&a[i].l,&a[i].r),n1+=(a[i].l>a[i].r);
S.clear(),S1.clear();
for(int i=1;i<=n1;i++)S.insert(i);
for(int i=n1+1;i<=n;i++)S1.insert(i);
sort(a,a+n);LL ans=0;
for(int i=0;i<n;i++){
if(a[i].l>a[i].r){
auto x=S.lower_bound(a[i].k+1);
if(x!=S.begin()){
x--;S.erase(x);
ans+=a[i].l;
}
else ans+=a[i].r;
}
else{
auto x=S1.upper_bound(a[i].k);
if(x!=S1.end()){
S1.erase(x);ans+=a[i].r;
}
else ans+=a[i].l;
}
}
printf("%lld\n",ans);
}
int main(){
int t;scanf("%d",&t);
while(t--)work();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
ll calc(int n, vector< vector<int> >& vs) {
priority_queue<int, vector<int>, greater<int> > pq;
for (int i = 1; i <= n; i++) {
for (int x : vs[i]) {
pq.push(x);
}
while (pq.size() > i) pq.pop();
}
ll res = 0;
while (!pq.empty()) {
res += pq.top();
pq.pop();
}
return res;
}
ll solve(int n, vector<int>& K, vector<int>& L, vector<int>& R) {
ll ans = 0;
vector< vector<int> > vs1(n + 1), vs2(n + 1);
for (int i = 0; i < n; i++) {
ans += min(L[i], R[i]);
if (L[i] >= R[i]) vs1[K[i]].push_back(L[i] - R[i]);
else vs2[n - K[i]].push_back(R[i] - L[i]);
}
ans += calc(n, vs1) + calc(n, vs2);
return ans;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int t;
cin >> t;
for (int loop = 0; loop < t; loop++) {
int n;
cin >> n;
vector<int> K(n), L(n), R(n);
for (int i = 0; i < n; i++) {
cin >> K[i] >> L[i] >> R[i];
}
cout << solve(n, K, L, R) << newl;
}
return 0;
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
auto doit = [] (vector<pair<int, int>>& v) -> long long {
sort(v.rbegin(), v.rend());
int pos = (int) v.size() - 1;
long long res = 0;
priority_queue<long long> que;
int it = 0;
while (pos >= 0) {
while (it < (int) v.size() && v[it].first >= pos) {
que.push(v[it++].second);
}
if (!que.empty()) {
res += que.top();
que.pop();
}
pos--;
}
return res;
};
auto solve = [&] () -> long long {
int n;
cin >> n;
vector<pair<int, int>> type1, type2;
long long res = 0;
for (int i = 0; i < n; i++) {
int k, l, r;
cin >> k >> l >> r;
if (l >= r) {
k--;
res += r;
type1.emplace_back(k, l - r);
} else {
k = n - k;
k--;
res += l;
type2.emplace_back(k, r - l);
}
}
return res + doit(type1) + doit(type2);
};
int t;
cin >> t;
while (t--) cout << solve() << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
int k;
ll l, r;
ll ans = 0;
vector<ll> vl[n + 2], vr[n + 2];
rep(i, n) {
cin >> k >> l >> r;
if (l > r) {
ans += r;
vl[k].emplace_back(l - r);
} else {
ans += l;
vr[k + 1].emplace_back(r - l);
}
}
priority_queue<int, vector<int>, greater<int>> que;
for (int i = 1; i <= n; i++) {
for (ll x : vl[i]) {
que.emplace(x);
}
while ((int)que.size() > i) {
que.pop();
}
}
while (!que.empty()) {
ans += que.top();
que.pop();
}
for (int i = n; i > 0; i--) {
for (ll x : vr[i]) {
que.emplace(x);
}
while ((int)que.size() > n - i + 1) {
que.pop();
}
}
while (!que.empty()) {
ans += que.top();
que.pop();
}
cout << ans << endl;
}
signed main() {
int number_of_testcases;
cin >> number_of_testcases;
while (number_of_testcases--) {
solve();
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.