zoukankan      html  css  js  c++  java
  • HDU 2088 Box of Bricks

    http://acm.hdu.edu.cn/showproblem.php?pid=2088

    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?
     
    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
    5
     
    代码:
    #include <bits/stdc++.h>
    using namespace std;
    
    int a[111];
    
    int main()
    {
        int n;
        int num=0;
        while(~scanf("%d",&n)) {
                if(n==0) break;
                num++;
                if(num>1) printf("
    ");
            long long sum=0;
            for(int i=1; i<=n; i++) {
                scanf("%d",&a[i]);
                sum+=a[i];
            }
            int ave=sum/n;
            int cnt=0;
            for(int i=1; i<=n; i++) {
                if(a[i]>ave)
                    cnt+=a[i]-ave;
            }
            printf("%d
    ",cnt);
        }
        return 0;
    }
    

      

  • 相关阅读:
    Jenkins和pipeline
    Docker摘要
    javascript文件加载模式与加载方法
    Pre-shared key
    持续集成CI相关的几个概念
    Fetch诞生记
    Content Security Policy介绍
    vivalidi 一款由Web技术诞生的Web浏览器
    Javascript async异步操作库简介
    Polymer初探
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9364030.html
Copyright © 2011-2022 走看看