1113 Integer Set Partition（小模拟）（简单逻辑)

最新推荐文章于 2023-10-26 00:12:49 发布

qq_41698081

最新推荐文章于 2023-10-26 00:12:49 发布

阅读量124

点赞数

分类专栏： pat甲级(模拟题)

本文链接：https://blog.csdn.net/qq_41698081/article/details/99735170

版权

pat甲级(模拟题) 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

/**
本题题意：
   题意就是给定n个数，现在要将n个数分成2堆
   首先要使每堆的个数差最小，然后要使每堆的和差最大
本题思路:
   首先将n个数按从小到大排序，然后将数字分隔成1 ： 1（这样差就最小）
   当n为奇数时，将中间数归到已经完成排序的数字右边，这样和差最大
**/

#include<iostream>
#include<algorithm>
using namespace std;
const int maxsize = 1e5 + 5;
int a[maxsize];
int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%d", &a[i]);
	}
	int mid = (n - 1) / 2;
	sort(a, a + n);
	int a1 = 0, a2 = 0;
	for(int i = 0; i < n; i++){
		if(n % 2 == 0){
			if(i <= mid)
				a1 += a[i];
			else
				a2 += a[i];
		}else{
			if(i < mid)
				a1 += a[i];
			else
				a2 += a[i];
		}
	}
	printf("%d %d\n", 2 * (mid + 1) - n, a2 - a1);
	return 0;
}