PAT-1113 Integer Set Partition

最新推荐文章于 2022-11-15 17:07:48 发布

原创最新推荐文章于 2022-11-15 17:07:48 发布 · 100 阅读

0 ·

CC 4.0 BY-SA版权

浙大PAT-Advanced 专栏收录该内容

119 篇文章

订阅专栏

博客围绕整数集分区问题展开，给定一组正整数，需将其分成两个不相交集合A1和A2，要使|n1 - n2|最小，|S1 - S2|最大。介绍了输入规范，包含整数N及后续正整数；输出规范为打印|n1 - n2|和|S1 - S2|。还给出了示例输入输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1113 Integer Set Partition（25 分）

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

#include<stdio.h>
#include<algorithm>
using namespace std;

int a[100005];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",a+i);
	}
	sort(a,a+n);
	int s1=0,s2=0;
    for(int i=0;i<n/2;i++){
		s1+=a[i];
	}
	for(int i=n/2;i<n;i++){
		s2+=a[i];
	}
	if(n%2==0){
		printf("%d %d",0,s2-s1);
	}else{
		printf("%d %d",1,s2-s1);
	}

	return 0;
}