1625: Box of Bricks

题目描述

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?

输入

暂无

输出

暂无

样例输入

6
5 2 4 1 7 5
0

样例输出

Set #1
The minimum number of moves is 5.

参考代码

#include<stdio.h>
int s[100];
int main() 
{
    int i,j,n,sum,k,l=1;
    while(scanf("%d",&n) && n) 
    {
        sum=0;
        k=0;
        for (i=0;i<n;i++) 
        {
            scanf("%d",&s[i]);
            sum+=s[i];
        }
        j=sum/n;
        for (i=0;i<n;i++) 
        {
            if(s[i]>j)
                        k+=s[i]-j;
        }
        printf("Set #%dnThe minimum number of moves is %d.nn",l,k);
        l++;
    }
    return 0;
}

解析

暂无