1113 Integer Set Partition

题目来源：PAT (Advanced Level) Practice

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

Input Specification:

Each input file contains one test case. For each case, the first line gives an integer N (2≤N≤10​5​​), 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​31​​.

Output Specification:

For each case, print in a line two numbers: ∣n​1​​−n​2​​∣ and ∣S​1​​−S​2​​∣, 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

words:

Partition 隔离，分割        disjoint 解体，脱节       

题意： 

将给定的n个数分为两组，两组的元素个数分别位n1和n2，元素和为s1和s2，分割的时候首先使|n1-n2|最小，然后使|s1-s2|最大；

思路：

1. 将n个元素进行排序，从小到大；

2. 将前面n/2个元素分为一组（n1=n/2），剩余的元素为另一组（n2=n-n/2），并分别求他们的和s1和s2；

3. 输出n2-n1和s2-s1；

//PAT ad 1113 Integer Set Partition
#include <iostream>
using namespace std; 
#include <algorithm>

int main()
{
	int n,i;
	cin>>n;
	int a[n];
	for(i=0;i<n;i++)
		cin>>a[i];
	
	sort(a,a+n);		//升序排序 

	int s1=0,s2=0;
	int m=n/2; 
	for(i=0;i<m;i++)		//求s1 
		s1+=a[i];
	for(;i<n;i++)			//求s2 
		s2+=a[i];
	 
	cout<<n-m-m<<" ";			//n1-n2 
	cout<<s2-s1<<endl;			//s1-s2
	
	return 0;
 }