通过交换a,b+中的元素，使[序列a+元素的和]与[序列b+元素的和]之间的差最小

/**
Q32.有两个序列a,b，大小都为n,序列元素的值任意整数，无序.  
  
要求：通过交换a,b中的元素，使[序列a元素的和]与[序列b元素的和]之间的差最小。   
例如:   
int[] a = {100,99,98,1,2,3};   
int[] b = {1, 2, 3, 4,5,40};  
  
求解思路：   
当前数组a和数组b的和之差为 A = sum(a) - sum(b) a的第i个元素和b的第j个元素交换后，  
a和b的和之差为 A'   
=sum(a) - a[i] + b[j] - （sum(b) - b[j] + a[i])   
= sum(a) - sum(b) - 2 (a[i] -b[j])   
= A - 2 (a[i] - b[j])   
设x = a[i] - b[j], 则交换后差值变为 A’ = A - 2x  
  
假设A > 0, 当x 在 (0,A)之间时，做这样的交换才能使得交换后的a和b的和之差变小，x越接近A/2效果越好,  
如果找不到在(0,A)之间的x，则当前的a和b就是答案。 所以算法大概如下：  
在a和b中寻找使得x在(0,A)之间并且最接近A/2的i和j，交换相应的i和j元素，重新计算A后，  
重复前面的步骤直至找不到(0,A)之间的x为止。  
*/  
#include <iostream>
#include <math.h>
using namespace std;

bool swap2Balance(int* pa, int* pb, int n)
{
	int suma = 0, sumb = 0;
	for (int i = 0; i < n; i++)
	{
		suma += pa[i];
		sumb += pb[i];
	}

	int diff = suma - sumb;
	while(diff != 0)
	{
		int besti =0, bestj = 0;
		int	bestchange = 0;
		for ( int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				int change = pa[i] - pb[j];
				if (abs(diff-2*change) < abs(diff-2*bestchange))
				{
					bestchange = change;
					besti = i;
					bestj = j;
				}
			}
		}

		if (bestchange == 0)
			return false;
		int temp = pa[besti];
		pa[besti] = pb[bestj];
		pb[bestj] = temp;

		suma -= bestchange;
		sumb += bestchange;
		diff = suma - sumb;
	}
	return true;
}

int main()
{
	int a[] = {100,99,98,1,2,5};   
	int b[] = {1, 2, 3, 4,5,40};  
	if (swap2Balance(a, b, 6))
	{
		cout<<"Put the tow arrays into balance:"<<endl;
		for (int i = 0; i < 6; i++)
		{
			cout<<a[i]<<" ";
		}
		cout<<endl;
		for (int i = 0; i < 6; i++)
		{
			cout<<b[i]<<" ";
		}
	}
	else
	{
		cout<<"cannot put two arrays into balance"<<endl;
		for (int i = 0; i < 6; i++)
		{
			cout<<a[i]<<" ";
		}
		cout<<endl;
		for (int i = 0; i < 6; i++)
		{
			cout<<b[i]<<" ";
		}
	}
}

此题的解题思路可用来解决编程之美中的数据分割。