# Box of Bricks

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7422 Accepted Submission(s): 1717

Problem 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 consideration, 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. You may assume 1≤n≤50 and 1≤hi≤100.

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, print the minimum number of bricks that have to be moved in order to make all the stacks the same height.
Output a blank line between each set.

Sample Input
6
5 2 4 1 7 5
0

Sample Output
Set #1
The minimum number of moves is 5.

#include <stdio.h>
#include <algorithm>
using namespace std;

int main()
{
int n,cas = 1;
while(~scanf("%d",&n),n)
{
int a[100],i,sub = 0;
for(i = 0;i<n;i++)
{
scanf("%d",&a[i]);
sub+=a[i];
}
sub = sub/n;
sort(a,a+n);
int sum = 0;
printf("Set #%d\nThe minimum number of moves is ",cas++);
while(a[n-1]>sub)
{
if(a[n-1]-sub>sub - a[0])//最大的达到平均值时多出的比最小的欠缺的多，把小的补满，大的统计剩余的
{
sum+=sub-a[0];
a[n-1] = a[n-1] - (sub-a[0]);
}
else if(a[n-1]-sub == sub - a[0])//相等则两两补满
{
sum+=a[n-1]-sub;
a[n-1] = sub;
a[0] = sub;
}
else//小于，则先把最大的变成平均，多出的移到最少
{
sum += a[n-1] - sub;
a[n-1] = sub;
a[0] = a[0] + a[n-1] - sub;
}
sort(a,a+n);//每次都排序一次
}
printf("%d.\n\n",sum);
}

return 0;
}

• 本文已收录于以下专栏：

## HDU1326_Box of Bricks【水题】

• u011676797
• 2014年11月21日 19:51
• 1080

## HDU 1.2.2 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others...
• hwj_wayne
• 2016年03月10日 18:03
• 127

## HDU 1326 Box of Bricks（数学题）

HDU 1326 Box of Bricks（数学题）
• u012860063
• 2014年09月06日 09:44
• 985

## HDU—— 2088 Box of Bricks

• u014086857
• 2014年12月05日 20:39
• 350

## (1.2.2) Box of Bricks

#include #include int main() { int n,hi,j,i,sum,m=0,count; int arr[55]={0}; while(scanf("%d",&n)...
• woainiwss
• 2014年03月15日 10:51
• 668

## 1.2.2 Box of Bricks

Problem Description Little Bob likes playing with his box of bricks. He puts the bricks one upon an...
• qq_20141243
• 2016年03月27日 00:47
• 102

## HDU2088 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
• i1020
• 2016年11月25日 22:07
• 109

## uva 591 Box of Bricks（求平均值）

Box of Bricks  Little Bob likes playing with his box of bricks. He puts the bricks one upon a...
• u011328934
• 2013年07月31日 10:25
• 1581

## HDU1326：Box of Bricks

Problem Description Little Bob likes playing with his box of bricks. He puts the bricks one upon an...
• libin56842
• 2013年04月16日 15:14
• 3289

## 【贪心】 Box of Bricks

Description Little Bob likes playing with his box of bricks. He puts the bricks one upon anothe...
• u012970471
• 2014年07月24日 12:32
• 535

举报原因： 您举报文章：HDU 1.2.2 Box of Bricks 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)