PAT-A1113 Integer Set Partition 题目内容及题解

本文链接：https://blog.csdn.net/Bourbon_Whiskey_/article/details/86772635

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≤10^5), 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^31.

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<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

int sum,sum1;

int main(){
    vector<int> seq;
    int i,a,N;
    scanf("%d",&N);
    for(i=0;i<N;i++){
        scanf("%d",&a);
        sum+=a;
        seq.push_back(a);
    }
    sort(seq.begin(),seq.end());
    a=N%2;
    N/=2;
    for(i=0;i<N;i++){
        sum1+=seq[i];
    }
    printf("%d %d\n",a,sum-2*sum1);
    return 0;
}