https://pintia.cn/problem-sets/994805342720868352/problems/994805357258326016
就排序,前一半给A,后一半给B.
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N],n,sum1,sum2;
int main(void)
{
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
for(int i=0;i<n/2;i++) sum1+=a[i];
for(int i=n/2;i<n;i++) sum2+=a[i];
cout<<(n%2?1:0)<<" "<<sum2-sum1;
return 0;
}