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
思路
这好像是某年的408考研题,我记得是可以不用全排序的,用快速排序的思想找出枢轴值,使其位于整个序列中央即可,复杂度更低。但是…毕竟考研结束了,快排已经不熟练了,原谅我选择直接使用sort()函数全排序…
AC代码
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main(){
int n, a[100001];
int s1 = 0, s2 = 0;
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%d", a + i);
sort(a, a + n);
int mid = n / 2;
for(int i = 0; i < mid; i++)
s1 += a[i];
for(int i = mid; i < n; i++)
s2 += a[i];
printf("%d %d", n % 2, abs(s1 - s2));
return 0;
}