AcWing每日一题--整数集合划分

https://www.acwing.com/problem/content/1605/

 

 

 

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N=1e5+10;
LL a[N];
int main(void){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    int sum1=0,sum2=0;
    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<<" "<<sum2-sum1;
    return 0;
}