Submission #3689673

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
priority_queue<int,vector<int>,greater<int> > s;
int n,x;
long long ji,ou;

int main(){
	cin>>n;
	for(res i=1;i<=n;++i) cin>>x,s.push(x);
	for(res i=1;i<=n;++i){
		if(i&1) ji+=(ll)s.top();
		else ou+=(ll)s.top();
		s.pop();
	}
	cout<<max(ji,ou)<<endl;
	return 0;
}

Submission Info

Judge Result