https://codeforces.com/gym/100488/problem/K
思路:看完某大佬的博客才会,,还是菜。。multiset可以存重复的元素并排序,所以强盗轮流拿,当第二个强盗要拿的大于第一个拿的最小值时,我们就可以认为第一个该拿第二个拿的的,所以反过来。
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<cmath>
#define INF 0x3f3f3f3f
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
int n, a[100010];
multiset<int>s;
int main() {
while(~scanf("%d", &n)) {
s.clear();
ll sum = 0;
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]), sum += a[i];
if(n % 2)
n++;
ll ans = 0;
for(int i = 1; i < n; i += 2) {
ans += a[i];
s.insert(a[i]);
if(a[i + 1] > *s.begin()) {
ans += a[i + 1] - *s.begin();
s.insert(a[i + 1]);
s.erase(s.begin());
}
}
printf("%I64d %I64d\n", ans, sum - ans);
}
return 0;
}