HDU 1326 Box of Bricks（简单数学题）

标签：hdu   水   数学   

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1326

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 <cstdio>
int main()
{
    int n;
    int a[57];
    int k = 0;
    while(scanf("%d",&n) && n)
    {
        int sum = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%d",&a[i]);
            sum +=a[i];
        }
        int avg = sum/n;
        int ans = 0;
        for(int i = 0; i < n; i++)
        {
            if(a[i] > avg)
                ans += a[i]-avg;
        }
        printf("Set #%d\n",++k);
        printf("The minimum number of moves is %d.\n\n",ans);
    }
    return 0;
}

HDU 1326 Box of Bricks（简单数学题）

标签：hdu   水   数学   

原文地址：http://blog.csdn.net/u012860063/article/details/39099039