1. 程式人生 > >PAT (Advanced Level) Practice 1113 Integer Set Partition (25 分)

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

#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; }