PAT (Advanced Level) Practise 1113 Integer Set Partition (25)

1113. Integer Set Partition (25)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

题意：给你n个数，将它们分为两个集合，使得两个集合中的元素个数差尽量小，元素和的差尽量大

解题思路：将n个数排序后，前n/2个数放入一个集合，剩余的数放入另一个集合

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <bitset>
#include <set>
#include <vector>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int n, a[100080];

int main()
{
	while (~scanf("%d", &n))
	{
		int sum = 0,sum1=0;
		for (int i = 1; i <= n; i++) scanf("%d", &a[i]),sum+=a[i];
		sort(a + 1, a + 1 + n);
		for (int i = 1; i <= n / 2; i++) sum1 += a[i];
		printf("%d %d\n", n - n / 2 * 2, sum - sum1 - sum1);
	}
	return 0;
}