1113 Integer Set Partition

目录

Input Specification:

Output Specification:

Sample Input 1:

Sample Output 1:

Sample Input 2:

Sample Output 2:

---

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

C++：

#include<bits/stdc++.h>
using namespace std;
int n,a[1000001],i;
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)cin>>a[i];
    int s1=0,s2=0;
    sort(a+1,a+n+1);//从小到大排序
    for(i=1;i<=n/2;i++)s1+=a[i];
    for(i=n/2+1;i<=n;i++)s2+=a[i];
    cout<<n%2<<' '<<s2-s1;
}