PAT 甲级1113 Integer Set Partition

1113 Integer Set Partition

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2 numbers, respectively. Let S1 and S2 denote the sums of all the numbers in A1 and A2, respectively. You are supposed to make the partition so that ∣n1−n2∣ is minimized first, and then ∣S1−S2∣ is maximized.

Input Specification:

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

Output Specification:

For each case, print in a line two numbers: ∣n1−n2∣ and ∣S1−S2∣, 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

给出的 n 个整数分成两个不相交的集合，元素个数差值最小同时元素之和差值最大。因此把元素从小到大排序，最小的 n/2 个数是第一个集合，剩下的是第二个。总元素个数为偶数时两个集合元素个数差值 0，否则是 1；注意 sum1 和 sum2 一定要把初始值置为 0

时间复杂度 O(n)，空间复杂度 O(1)

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int n, i, sum1 = 0, sum2 = 0;
	scanf("%d", &n);
	vector<int> v(n);
	for(i = 0; i < n; ++i) {
		scanf("%d", &v[i]);
	}	
	sort(v.begin(), v.end());
	for(i = 0; i < n/2; ++i)	sum1 += v[i];
	for(; i < n; ++i)	sum2 += v[i];
	printf("%d %d\n", n % 2, sum2 - sum1);
	return 0;
} 

测试点	结果	耗时	内存
0	答案正确	3 ms	256 KB
1	答案正确	4 ms	384 KB
2	答案正确	30 ms	768 KB
3	答案正确	17 ms	876 KB
4	答案正确	5 ms	384 KB

进一步的优化可以在读取所有元素时计算总和 sum，排序后计算前 n/2 的元素和 sum1 ，两个集合的差值为 sum - 2 * sum1

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int n, sum = 0, sum1 = 0;
	scanf("%d", &n);
	vector<int> v(n);
	for(int i = 0; i < n; ++i) {
		scanf("%d", &v[i]);
		sum += v[i];
	}	
	sort(v.begin(), v.end());
	for(int i = 0; i < n/2; ++i)	sum1 += v[i];
	printf("%d %d\n", n % 2, sum - 2 * sum1);
	return 0;
} 

测试点	结果	耗时	内存
0	答案正确	3 ms	424 KB
1	答案正确	3 ms	356 KB
2	答案正确	31 ms	740 KB
3	答案正确	23 ms	808 KB
4	答案正确	3 ms	224 KB