题目链接:http://poj.org/problem?id=1477
大水题,水博客~
#include <iostream>
using namespace std;
int main(){
int n;
int cas = 0;
while( cin>>n && n ){
int high[n],avg,sum,num;
cas++;
sum = 0;
for(int i=0 ; i<n ; i++)
cin>>high[i],sum += high[i];
avg = sum / n;
num = 0;
for(int i=0 ; i<n ; i++)
num += high[i] > avg ? high[i] - avg : 0 ;
cout<<"Set #"<<cas<<endl<<"The minimum number of moves is "<<num<<'.'<<endl<<endl;
}
return 0;
}