Box of Bricks

Box of Bricks

时间: 1ms        内存:64M

描述:

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?

输入:

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.

输出:

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.

示例输入:

6
5 2 4 1 7 5
0

示例输出:

Set #1
The minimum number of moves is 5.

提示:

参考答案(内存最优[748]):

#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 #%d\nThe minimum number of moves is %d.\n\n",l,k);
        l++;
    }
    return 0;
}

参考答案(时间最优[0]):

#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 #%d\nThe minimum number of moves is %d.\n\n",l,k);
        l++;
    }
    return 0;
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注