Box of Bricks

最新推荐文章于 2019-06-30 01:30:42 发布

原创最新推荐文章于 2019-06-30 01:30:42 发布 · 504 阅读

0 ·

CC 4.0 BY-SA版权

HDOJ--ACMSteps 专栏收录该内容

18 篇文章

订阅专栏

本文描述了一个关于重新排列砖块堆使其高度一致的算法问题。小Bob需要将不同高度的砖块堆调整到相同的高度，目标是最小化移动砖块的数量。文章提供了问题描述、输入输出格式及样例。

Box of Bricks

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2481 Accepted Submission(s): 567

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?
Box <wbr>of <wbr>Bricks

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

Set #1
The minimum number of moves is 5.

Author

qianneng

Source

冬练三九之二

Recommend

lcy

#include<iostream>
using namespace std;
int main()
{
      int n,k=1,sum,h,a[101],i;
      while(cin>>n&&n)
      {
         sum=0;
         int m=0;
         for(i=0;i<n;i++)
       {
          cin>>a[i];
           sum+=a[i];
        }
       h=sum/n;
      for(i=0;i<n;i++)
         if(a[i]>h)
             m+=a[i]-h;
       cout<<"Set #"<<k++<<endl;
   cout<<"The minimum number of moves is "<<m<<"."<<endl;
   cout<<endl;
      }

}