UVa 591-Box of Bricks

2019独角兽企业重金招聘Python工程师标准>>>

【问题描述】

    Description

    Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. ``Look, I've built a wall!'', he tells his older sister Alice. ``Nah, you should make all stacks the same height. Then you would have a real wall.'', she retorts. After a little con- sideration, Bob sees that she is right. So he sets out to rearrange the bricks, one by one, such that all stacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimum number of bricks moved. Can you help?

    Input

    The input consists of several data sets. Each set begins with a line containing the number n of stacks Bob has built. The next line contains n numbers, the heights hi of the n stacks. The total number of bricks will be divisible by the number of stacks. Thus, it is always possible to rearrange the bricks such that all stacks have the same height. The input is terminated by a set starting with n = 0. This set should not be processed.

    Output

    For each set, first print the number of the set, as shown in the sample output. Then print the line ``The minimum number of moves isk.'', where k is the minimum number of bricks that have to be moved in order to make all the stacks the same height. Output a blank line after each set.

    Sample Input 

6
5 2 4 1 7 5
0

Sample Output

Set #1
The minimum number of moves is 5.

【解题思路】

    求出平均数，把超过平均数的加和即可。

【具体实现】

#include <iostream>  

/*最大栈数*/
#define maxNum 50+1
using namespace std;

/*栈数、样例数*/
int stackNum, times;
/*各栈高度*/
int stackHigh[maxNum];

int main()
{
	times = 0;

	while (cin >> stackNum && 0 < stackNum && stackNum < maxNum) {
		/*方块数*/
		int sum = 0;
		/*求总方块数*/
		for (int i = 0; i < stackNum; ++i) {
			cin >> stackHigh[i];
			sum += stackHigh[i];
		}
		/*平均方块数*/
		sum /= stackNum;

		/*需要移动的块数*/
		int count = 0;
		/*如果大于平均方块数，则移动多出的*/
		for (int i = 0; i < stackNum; ++i){
			if (stackHigh[i] > sum)
				count += stackHigh[i] - sum;
		}
		
		cout << "Set #" << ++times << endl
			<< "The minimum number of moves is "
			<< count << "." << endl << endl;
	}

	return 0;
}

【额外补充】

    恩，就这样。

转载于:https://my.oschina.net/CoderBleak/blog/666721