/*
中文题目 箱子游戏
中文翻译-大意 移动最少的箱子,使它形成一道墙
解题思路:求解平均值
难点详解:见代码
关键点:求平均值
解题人:lingnichong
解题时间:2014-08-25 20:28:31
解题体会:水题
*/
Box of Bricks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4378 Accepted Submission(s): 1963
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 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. 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.
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 is k.'', 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.
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<stdio.h>
int arr[100];
int main()
{
int n,sum,ave;
int i,t=1;
while(scanf("%d",&n),n)
{
sum=ave=0;
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
sum+=arr[i];
}
ave=sum/n;
sum=0;
for(i=0;i<n;i++)
{
if(arr[i]<ave)
sum+=(ave-arr[i]);
}
printf("Set #%d\n",t++);
printf("The minimum number of moves is %d.\n",sum);
printf("\n");
}
return 0;
}