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 n2numbers, 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 555Sample Output 1:
0 3611Sample Input 2:
13 110 79 218 69 3721 100 29 135 2 6 13 5188 85Sample Output 2:
1 9359
https://www.patest.cn/contests/pat-a-practise/1113
思路:
排序,从两边向中间累加前后之差,最后针对中间的元素,使累加的绝对值尽可能的大
对于个数差,奇数为1,偶数为0
CODE:
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<algorithm>
#define N 100010
using namespace std;
int num[N];
int main()
{
int n;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%d",&num[i]);
}
sort(num,num+n);
int c=0;
for (int i=0,j=n-1;i<=j;i++,j--)
{
c+=(num[j]-num[i]);
}
if (n%2==1)
{
if (num[n/2]>=0)
{
if (c>=0)
{
c+=num[n/2];
}
else
{
c-=num[n/2];
}
}
else
{
if (c<0)
{
c+=num[n/2];
}
else
{
c-=num[n/2];
}
}
}
if (n%2==1)
{
cout<<1<<" ";
}
else
{
cout<<0<<" ";
}
if (c<0)
{
cout<<c*-1;
}
else
{
cout<<c;
}
return 0;
}