PAT A1113 Integer Set Partition

PAT A1113 Integer Set Partition

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

• 思路 1：
  水题：一个数组，分两堆：要求：元素个数差最小，和的差最大
  排序：

1. 如果n是偶数：小的一半[0, n/2)放一组，大的一半[n/2, n)放一组，如：(0 1) ( 2 3 4)（指下标）大的组要个数多，这样和的差才更大
2. 如果n是奇数：同样小的一半[0, n/2)放一组，大的一半[n/2, n)放一组：如：（0 1 ）（2 3）

• code 1:

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int input[maxn];
int main(){
	int n; 
	scanf("%d", &n);
	for(int i = 0; i < n; ++i){
		scanf("%d", &input[i]);
	}
	sort(input, input+n);
	int sum1 = 0, sum2 = 0;
	for(int i = 0; i < n/2; ++i)
		sum1 += input[i];
	for(int i = n/2; i < n; ++i)
		sum2 += input[i];
	printf("%d %d", n%2==0 ? 0 : 1, sum2-sum1);
	return 0;
}

• T2 code:

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n;
	scanf("%d", &n);
	vector<int> v(n);
	for(int i = 0; i < n; ++i){
		scanf("%d", &v[i]);
	}
	sort(v.begin(), v.end());
	int sum = 0;
	for(int i = 0; i < n / 2; ++i){
		sum -= v[i];
	}
	for(int i = n / 2; i < n; ++i){
		sum += v[i];
	}
	printf("%d %d", n % 2 == 0 ? 0 : 1, sum);
	return 0;
} 

• T3 code:

#include <bits/stdc++.h>
using namespace std;
vector<int> seq, sum;

int main()
{
    int n;
    scanf("%d", &n);
    seq.resize(n+1);
    sum.resize(n+1);
    for(int i = 1; i <= n; ++i) scanf("%d", &seq[i]);
    sort(seq.begin(), seq.end());
    for(int i = 1; i <= n; ++i) sum[i] = sum[i-1] + seq[i];
    int ans = (sum[n] - sum[n/2]) - (sum[n/2] - sum[0]);
    printf("%d %d", n % 2 == 0 ? 0 : 1, ans);
    return 0;
}