PAT (Advanced Level) Practice 1113 Integer Set Partition （25 分）

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/Nightmare_ak/article/details/84795287

#include<cstdio>
#include<algorithm>
using namespace std;

const int N=1e5+5;

int a[N];

int main()
{
    int n;scanf("%d",&n);
    int sum=0,half=0;
    for(int i=0;i<n;i++)
        scanf("%d",a+i),sum+=a[i];
    sort(a,a+n);
    for(int i=1;i<=(n+1)/2;i++)
        half+=a[n-i];
    printf("%d %d\n",n%2,2*half-sum);
    return 0;
}