#include <iostream>
#include<cstdio>
using namespace std;
int a[110];
int main()
{
int n,i,sum,count,x=0;
while(cin >> n&&n)
{
sum=0,count=0;
for(i=0; i<n; i++)
{
cin >> a[i];
sum+=a[i];
}
sum/=n;
for(i=0; i<n; i++)
if(a[i]>sum) count+=(a[i]-sum);
x++;
printf("Set #%d\nThe minimum number of moves is %d.\n\n",x,count);
}
return 0;
}
HOJ 1599-------Box of Bricks
最新推荐文章于 2019-06-30 01:30:42 发布