Submission #66139349

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<bits/stdc++.h>
#define int long long
#define jiaa(a,b) {a+=b;if(a>=MOD) a-=MOD;}
#define jian(a,b) {a-=b;if(a<0) a+=MOD;}
using namespace std;
int ksm(int a,int b,int p){
	if(b==0) return 1;
	if(b==1) return a%p;
	int c=ksm(a,b/2,p);
	c=c*c%p;
	if(b%2==1) c=c*a%p;
	return c%p;	
}
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
int a[1000005];
priority_queue<int> ht;
signed main()
{
	//freopen("filename.in", "r", stdin);
	//freopen("filename.out", "w", stdout);
	int T=read();
	while(T--){
		int n=read()*2;
		for(int i=1;i<=n;i++) a[i]=read();
		int ans=a[1];
		for(int i=2;i<n;i+=2){
			ht.push(a[i]);
			ht.push(a[i+1]);
			ans+=ht.top();
			ht.pop();
		}
		while(!ht.empty()) ht.pop();
		cout<<ans<<'\n';
	}
	return 0;
}

Submission Info

Judge Result