1113 Integer Set Partition(25)

最新推荐文章于 2021-02-16 16:11:26 发布

Fcity_sh

最新推荐文章于 2021-02-16 16:11:26 发布

阅读量243

点赞数

分类专栏：算法文章标签： 1113 Integer Set Partition(25) 甲级 pat

本文链接：https://blog.csdn.net/fcity_sh/article/details/84035555

版权

算法专栏收录该内容

52 篇文章 0 订阅

订阅专栏

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2numbers, 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

题意：把一组数分成两个集合，在N2-N1最小的前提下，保证S2-S1最大。

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int sum = 0;//集合之和
	int cnt;
	int *arry = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> arry[i];
		sum += arry[i];
	}
	sort(arry, arry + n);
	int sum1 = 0;//集合一半之和
	for (int i = 0; i < n / 2; i++)
		sum1 += arry[i];
	cout << n % 2 << " " << sum - 2*sum1 << endl;
	return 0;
}