1326 box of bricks.cpp

ACM 威士忌部分答案

/*
1326 Box of Bricks
Time Limit : 1000 ms  Memory Limit : 32768 K  Output Limit : 256 K

GUN C++
*/
#include <iostream.h>
using namespace std;

const int hiMax=100;

int main()
{
    int n,ca,set=1,k,avg,total;
    int hi[50];
    while(cin>>n && n!=0)
    {
        cout<<"Set #"<<set<<endl;
        set++;total=0;
        for(ca=0;ca<n;ca++)
        {   cin>>hi[ca];total+=hi[ca];}
        
        avg=total/n;k=0;
        for(ca=0;ca<n;ca++)
        {
            hi[ca]-=avg;
            if(hi[ca]>0)
                k+=hi[ca];
        }
        cout<<"The minimum number of moves is "<<k<<".\n\n";
    }
    return 0;
}