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.
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.
Sample Input
6
5 2 4 1 7 5
0
Sample Output
Set #1
The minimum number of moves is 5.
解题思路:
求出每组数据的平均数,然后每个数字与平均数差的绝对值的和再除2就是结果,思路的根据是大于平均数高度的砖块要搬给低于平均高度的砖块
细节处理:
注意在输出的最后还有个“.”
代码:
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n,i,sum=0,num=0,t; int a[105];
while(cin>>n)
{
sum=0; int x=0;
if(n==0) break;
num++;
for(i=1;i<=n;i++)
{cin>>a[i]; sum+=a[i];}
t=sum/n;
for(i=1;i<=n;i++)
{
if((a[i]-t)<0) x+=-(a[i]-t);
else x+=a[i]-t;
}
cout<<"Set #"<<num<<endl;
cout<<"The minimum number of moves is "<<x/2<<".";
cout<<endl<<endl;
}
return 0;
}