1113. Integer Set Partition (25)

Given a set of N (> 1) positive integers, you are supposed to partition them into two disjoint sets A₁ and A₂ of n₁ and n₂ numbers, respectively. Let S₁ and S₂ denote the sums of all the numbers in A₁ and A₂, respectively. You are supposed to make the partition so that |n₁ - n₂| is minimized first, and then |S₁ - S₂| is maximized.

Input Specification:

Each input file contains one test case. For each case, the first line gives an integer N (2 <= N <= 10⁵), and then N positive integers follow in the next line, separated by spaces. It is guaranteed that all the integers and their sum are less than 2³¹.

Output Specification:

For each case, print in a line two numbers: |n₁ - n₂| and |S₁ - S₂|, separated by exactly one space.

Sample Input 1:

10
23 8 10 99 46 2333 46 1 666 555

Sample Output 1:

0 3611

Sample Input 2:

13
110 79 218 69 3721 100 29 135 2 6 13 5188 85

Sample Output 2:

1 9359

---

将一个序列分成两个集合，首先要使得两个集合的大小之差的绝对值尽量小，其次要使两个集合各自的和的差的绝对值最大。故先对序列排序，然后如果序列大小是偶数，两个集合大小就是序列大小的一半；如果是奇数，则第二个集合要比第一个集合多一个数。然后第一个集合是序列中比较小的数，第二个集合是序列中较大的数，这样各自求和再求差就能得到结果。

代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sort(a.begin(),a.end());
	
	int Min=(n%2==0)?0:1,size1=n/2;
	
	int i,sum1=0,sum2=0;
	for(i=0;i<size1;i++)
	{
		sum1+=a[i];
	}
	for(i;i<n;i++)
	{
		sum2+=a[i];
	}
	cout<<Min<<" "<<sum2-sum1<<endl;
}