ZCMU-1415

最新推荐文章于 2022-07-23 11:36:36 发布

原创最新推荐文章于 2022-07-23 11:36:36 发布 · 402 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

187 篇文章

订阅专栏

本文介绍了一个编程问题，即如何通过移动最少数量的砖块来使所有砖堆的高度相等。文章提供了一段C语言代码示例，展示了如何计算达到统一高度所需的最小移动次数。

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

1415: Box of Bricks

Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 222 Solved: 101
[ Submit][ Status][ Web Board]

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 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?

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, 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.

Sample Input

5 2 4 1 7 5

Sample Output

Set #1

The minimum number of moves is 5.

【解析】

这道题呢其实就是给你砖头数问你要移动多少块，就是说你先算出平均的高度，这个时候我们模拟一下会发现其实就是把比平均高的给移动走就存在这样的过程比平均高度高的移动移动走的砖头有的其实就是给了比平均高度矮的，有的是直接移动走了。

#include <stdio.h>
int main()
{
    int n,i,count1=0,sum1,average,sum2;
    int a[100];
 while(scanf("%d", &n)&&n!=0)
 {
      sum1=sum2= 0;
      count1++;
     for(i=0; i<n; i++)
  {
       scanf("%d", &a[i]);
  }
  for(i=0; i<n; i++)
  {
        sum1+=a[i];     //计算总数
  }
  average=sum1/n;
  for(i=0; i<n; i++)   //计算要移动的箱子数
  {
      if(a[i]>average)
   {
       sum2=sum2+a[i]-average;
   }

  }
printf("Set #%d\n", count1);
  printf("The minimum number of moves is %d.\n\n", sum2);
 }

    return 0;
}