UVA591-一盒砖

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


一遍过的水题哎，
没什么技术含量！！！