【PAT】1113. Integer Set Partition

#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define FOR(i, x, y) for(int i = x; i <= y; i++)
#define rFOR(i, x, y) for(int i = x; i >= y; i--)
#define MAXN 100010
#define oo 0x3f3f3f3f
using namespace std;

int a[MAXN];

int main()
{
     #ifdef LOCAL
        freopen("data.in","r",stdin);
        freopen("data.out","w",stdout);
    #endif // LOCAL

    int n;int sum=0;
    scanf("%d",&n);
    FOR(i,0,n-1)
    {
        scanf("%d",&a[i]);
        sum+=a[i];
    }
    sort(a,a+n);
    int ans=0;
    FOR(i,0,n/2-1)
    {
        ans+=a[i];
    }
    int flag=n%2==0?0:1;
    printf("%d %d",flag,sum-ans*2);

    return 0;
}