1113. Integer Set Partition (25)

#include <iostream>
#include <algorithm>

using namespace std;

int num[100010];

int main()
{
	int n;
	scanf("%d", &n);

	int i, sum = 0;
	for(i = 1; i <= n; i++)
	{
		scanf("%d", &num[i]);
		sum += num[i];
	}

	int res = 0;
	if(n % 2 == 1)
	{
		res = 1;
	}
	printf("%d ", res);

	sort(num + 1, num + n + 1);

	int n1 = n / 2, formersum = 0;
	for(i = 1; i <= n1; i++)
	{
		formersum += num[i];
	}
	printf("%d\n", sum - formersum - formersum);

	system("pause");
	return 0;
}