Submission #66127198

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#include"atcoder/all"
using namespace atcoder;
typedef modint998244353 mi;
using namespace std;
#define all(a) a.begin(),a.end()
#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
constexpr ll mod=998244353;
constexpr ll inf=3e18;

void solve(){
	int n;
	cin>>n;
	vector<ll>a(n*2);
	rep(i,n*2)cin>>a[i];
	priority_queue<ll>pq;
	pq.push(a[0]);
	ll ans=0;
	rep(i,n){
		ans+=pq.top();
		pq.pop();
		pq.push(a[i*2+1]);
		pq.push(a[i*2+2]);
	}
	cout<<ans<<endl;

}

int main(){
	int t;
	cin>>t;
	rep(T,t)solve();
}

Submission Info

Judge Result