1113 Integer Set Partition (25 point(s))

最新推荐文章于 2023-08-01 01:36:28 发布

coderwait

最新推荐文章于 2023-08-01 01:36:28 发布

阅读量115

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/coderwait/article/details/100185985

版权

PAT 专栏收录该内容

138 篇文章 0 订阅

订阅专栏

1113 Integer Set Partition (25 point(s))

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1and 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 Npositive 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<iostream>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
ll a[100007];
int main(void){
	int N;scanf("%d",&N);
	for(int i=0;i<N;i++) scanf("%lld",&a[i]);
	sort(a,a+N);
	ll sum = 0;
	for(int i=0;i<N;i++){
		if(i<N/2) sum=sum-a[i];
		else sum+=a[i];
	}
	if(N%2==0) printf("0 ");
	else printf("1 ");
	printf("%lld\n",sum);
	return 0;
}