HDU ACM 11 2088 Box of Bricks

#include <iostream>
using namespace std;
int main()
{
int n;
int Lu[51];
int flag = 0;
while (cin >> n && n != 0)
{
int sum = 0;
if (flag)
cout << endl;
flag = 1;
for (int i = 1; i <= n; i++)
{
cin >> Lu[i];
sum += Lu[i];
}
int average = sum/n;
int min = 0;
for (int i = 1; i <= n; i++)
if (Lu[i] > average)
min += (Lu[i] - average);
cout << min << endl;

}
return 0;
}