题目描述
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 two lines. The first line contains 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.
Output
Print the line"The minimum number of moves is k.",where k is the mimimum number of bricks that have to be moved in order to make all the stacks the same height.
Sample Input
6
5 2 4 1 7 5
Sample Output
The minimum number of moves is 5.
我写的代码是下面这个：
#include
#include
int main()
{ int n,hi[100],i,t,step=0,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&hi[i]);}
for(i=0;i<n;i++)
{sum=sum+hi[i];}
int ave;
ave=sum/n;
for(i=0;i<n;i++)
{t=fabs(ave-hi[i]);
step=t+step; }
printf("The minimum number of moves is %d.\n",step);
return 0;
}
但是用样例的数据检验时，我的结果是10，不是5，想知道错在哪里了
