zoukankan      html  css  js  c++  java
  • UVa 591 Box of Bricks

      Box of Bricks 

    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 Ÿle n leŸ 50$ and$1 leŸ h_i Ÿle 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 

    6
    5 2 4 1 7 5
    0
    

    Sample Output 

    Set #1
    The minimum number of moves is 5.
    

    Miguel A. Revilla 
    1998-03-10

    求平均数后做差再求和即可……

     1 #include<iostream>
     2 #include<cstdio>
     3 
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     int n;
     9     int kase=0;
    10     int brick[200];
    11 
    12     while(scanf("%d",&n)&&n)
    13     {
    14         kase++;
    15         int total=0;
    16         for(int i=0;i<n;i++)
    17         {
    18             scanf("%d",&brick[i]);
    19             total+=brick[i];
    20         }
    21         int ave=total/n;
    22         int ans=0;
    23         for(int i=0;i<n;i++)
    24             if(brick[i]>ave)
    25                 ans+=brick[i]-ave;
    26         printf("Set #%d
    ",kase);
    27         printf("The minimum number of moves is %d.
    
    ",ans);
    28     }
    29 
    30     return 0;
    31 }
    [C++]
  • 相关阅读:
    二货Mysql中设置字段的默认值问题
    Mongodb第一步资料
    时间时间
    嵌入式linux应用程序移植方法总结
    capwap DTSL 加密分析
    capwap协议重点分析
    一点论文写作心得
    live555+ffmpeg如何提取关键帧(I帧,P帧,B帧)
    “以图搜图”引擎及网站合集
    常见的希腊字母的读法
  • 原文地址:https://www.cnblogs.com/lzj-0218/p/3517035.html
Copyright © 2011-2022 走看看