uva 591 - Box of Bricks

水题

#include<iostream>
using namespace std;
int main(){
    int n;
    int h[101];
    int temp=1;
    while(cin>>n){
        int sum=0;
        if(n==0)
            break;
        for(int i=0;i<n;i++){
            cin>>h[i];
            sum+=h[i];
        }
        int ave=sum/n;
        sum=0;
        for(int i=0;i<n;i++)
            if(h[i]>ave)
                sum+=h[i]-ave;
        cout<<"Set #"<<temp++<<endl;
        cout<<"The minimum number of moves is "<<sum<<"."<<endl<<endl;
    }
}