zoukankan      html  css  js  c++  java
  • hdu1326

    Box of Bricks

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3091    Accepted Submission(s): 1388

    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 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
    6 5 2 4 1 7 5 0
     
    Sample Output
    Set #1 The minimum number of moves is 5.
     
     
    1. #include<iostream>
    2. #include<cstdio>
    3. using namespace std;
    4. int main()
    5. {  
    6. int sum,i,m=1,n,a[100000];
    7.  while(scanf("%d",&n)&&n)
    8.  {   
    9. sum=0;   
    10. for(i=0;i<n;i++)
    11.   {   
    12.  scanf("%d",&a[i]);
    13.    sum+=a[i];  
    14.  }   
    15. sum/=n;
    16.   int b;  
    17.  b=0;  
    18.  for(i=0;i<n;i++)  
    19.  {    
    20. if(sum>a[i])
    21.     b+=sum-a[i];
    22.   }
    23.   printf("Set #%d\nThe minimum number of moves is %d.\n\n",m++,b);
    24.  }  
    25. return 0;
    26. }   
  • 相关阅读:
    软件项目成员的业绩考核
    COM, COM+ and .NET 程序集的区别
    .Net 应用框架设计系列(二)
    怎样在Web开发中完美控制IE标题栏
    影楼系统
    PHP读取ACCESS数据到MYSQL
    简单分享apache 封 IP 的方法
    详解Apache下.htaccess文件常用配置
    fleaphp常用方法分页之Pager
    php遍历文件夹读取文件夹中图片并分页显示图片
  • 原文地址:https://www.cnblogs.com/Deng1185246160/p/2956781.html
Copyright © 2011-2022 走看看