1177: 零起点学算法84——Box of Bricks

最新推荐文章于 2021-11-17 13:31:19 发布

Zichel77

最新推荐文章于 2021-11-17 13:31:19 发布

阅读量318

点赞数

CC 4.0 BY-SA版权

分类专栏： WUSTOJ

本文链接：https://blog.csdn.net/weixin_43965597/article/details/113377761

WUSTOJ 专栏收录该内容

119 篇文章

订阅专栏

本文介绍了一个关于鲍勃堆叠砖块的故事，鲍勃试图将砖块重新排列，使得所有砖堆高度相同，而尽可能少地移动砖块。程序代码展示了如何计算最小移动次数，输入包含多组数据，每组数据包含砖堆数量和各堆的高度，输出为每组数据的最小移动次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Source

零起点学算法

Code

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n)&&n!=0)
    {
        int a[100]={0};
        int sum=0;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
        }
        int ave=sum/n;
        int sub=0;
        for(int i=0;i<n;i++)
        {
            if(a[i]>ave)
            {
                sub+=(a[i]-ave);
            }
        }
        cout<<sub<<endl;
        cout<<endl;
    }
}