#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;
int n,hi[55];

int main(int argc, char *argv[])
{
    int test=0;
    while(cin>>n,n){
                    test++;
                    int sum=0;
                    for(int i=0;i<n;i++){
                            cin>>hi[i];
                            sum+=hi[i];
                    }
                    sum=sum/n;
                    sort(hi,hi+n);
                    int move=0;
                    for(int i=n-1;i>=0;i--){
                            if(hi[i]>sum) move+=hi[i]-sum;
                            else break;
                    }
                    cout<<"Set #"<<test<<endl;
                    cout<<"The minimum number of moves is "<<move<<'.'<<endl<<endl;
    }
    return EXIT_SUCCESS;
}

• Re:太水了，这样也敢过。。。 (887) hnly 2011-07-19 19:54:13