PAT甲级 1113

题目 Integer Set Partition

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A​1​​ and A​2​​ of n​1​​ and n​2​​ numbers, respectively. Let S​1​​ and S​2​​ denote the sums of all the numbers in A​1​​ and A​2​​ , respectively. You are supposed to make the partition so that ∣n​1​​ −n​2​​ ∣ is minimized first, and then ∣S​1​​ −S​2​​ ∣ 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: ∣n​1​​ −n​2​​ ∣ and ∣S​1​​ −S​2​​ ∣, separated by exactly one space.

解析

将给出的数据分成两组，输出两组最小个数之差，输出两组各自和之差的最大值。将原数据排序，前一半为n1，后一半为n2；

代码

#include<bits/stdc++.h>
#include<string>

#define INF 1<<29

using namespace std;

int n;
int data[100005];

void pat1113() {
    cin >> n;
    int sum1 = 0, sum2 = 0;
    for (int i = 0; i < n; ++i) {
        cin >> data[i];

    }
    sort(data, data + n);
    for (int i = 0; i < n; ++i) {
        if (i < n / 2) {
            sum1 += data[i];
        } else {
            sum2 += data[i];
        }
    }
    if (n % 2 == 0) {
        cout << "0" << " " << abs(sum2 - sum1) << endl;
    } else {
        cout << "1" << " " << abs(sum2 - sum1) << endl;
    }
}

int main() {
    pat1113();
    return 0;
}