1113. Integer Set Partition

1113. Integer Set Partition (25)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Given a set of N (> 1) positive integers, you are supposed to partition them into two disjoint sets A₁ and A₂ of n₁ and n₂ numbers, respectively. Let S₁ and S₂ denote the sums of all the numbers in A₁ and A₂, respectively. You are supposed to make the partition so that |n₁ - n₂| is minimized first, and then |S₁ - S₂| is maximized.

Input Specification:

Each input file contains one test case. For each case, the first line gives an integer N (2 <= N <= 10⁵), 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³¹.

Output Specification:

For each case, print in a line two numbers: |n₁ - n₂| and |S₁ - S₂|, separated by exactly one space.

Sample Input 1:

1023 8 10 99 46 2333 46 1 666 555

Sample Output 1:

0 3611

Sample Input 2:

13110 79 218 69 3721 100 29 135 2 6 13 5188 85

Sample Output 2:

1 9359

这个题很直白。

#include<iostream>#include<vector>#include<algorithm>using namespace std;int a[100000];int main(){int n;cin>>n;int s1=0,s2=0;for(int i=0;i<n;i++)cin>>a[i];sort(a,a+n);for(int i=0;i<n/2;i++)s1+=a[i];for(int i=n/2;i<n;i++)s2+=a[i];if(n%2==0)cout<<"0 ";elsecout<<"1 ";cout<<s2-s1;}