PAT (Advanced Level) 1113. Integer Set Partition (25)

简单题。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;

long long a[+];
long long sum=,sum2;
int n;

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