hdu2088 Box of Bricks（C语言）

最新推荐文章于 2019-03-12 21:11:16 发布

水牛不喝水

最新推荐文章于 2019-03-12 21:11:16 发布

阅读量1.1k

点赞数 1

分类专栏：算法训练01-大学训练文章标签： ACM hdu c语言

本文链接：https://blog.csdn.net/sinat_39591298/article/details/76408447

版权

算法训练01-大学训练专栏收录该内容

116 篇文章 7 订阅

订阅专栏

这篇博客详细介绍了HDU 2088 Box of Bricks的问题，主要探讨如何使用C语言解决ACM竞赛中的算法问题。博主分享了他们的思考过程、代码实现及解题技巧，旨在帮助读者理解并掌握此类问题的解决方法。

摘要由CSDN通过智能技术生成

Problem 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 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 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, print the minimum number of bricks that have to be moved in order to make all the stacks the same height.
Output a blank line between each set.

Sample Input

  
  
   
   6
5 2 4 1 7 5
0

Sample Output

Author

qianneng

Source

冬练三九之二

C语言AC代码

#include<stdio.h>
int main()
{
    int i,n,a[55],s,t=0,sum;
    while(scanf("%d",&n)&&n)
    {
        if(t)
            printf("\n");
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        s=0;
        for(i=0; i<n; i++)
        {
            s=s+a[i];
        }
        s=s/n;
        sum=0;
        for(i=0; i<n; i++)
        {
            if(a[i]<s)
                sum=sum+(s-a[i]);
        }
        printf("%d\n",sum);
        t=1;
    }
    return 0;
}

思路：求出平均高度，低于平均高度的与平均高度的差值和就是最小值。