UVA - 591 Box of Bricks

UVA - 591 Box of Bricks

#include <iostream>
#include <cstdio>
using namespace std;

int main() {
int N = 0;
int n;
while ( scanf("%d",&n) != EOF && n ) {
N++;
int num[1000];
int sum = 0;
int ave;
int ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d",&num[i]);
sum += num[i];
}
ave = sum / n;
for (int i = 0; i < n; i++) {
if ( num[i] > ave )
ans = ans + num[i] - ave;
}
cout << "Set #" << N << endl;
cout << "The minimum number of moves is " << ans << "." << endl << endl;
}
return 0;
}