题目描述
1013: 摆积木
解决方案
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int numOneLine;
cin >> numOneLine;
do {
static int numOfArray = numOneLine;
int jimu[numOfArray];
int sum = 0, divide = 0, guardValue = 0;
for (int i = 0; i < numOfArray; i++) {
cin >> jimu[i];
sum = sum + jimu[i];
}
divide = sum / numOfArray;
for (int i = 0; i < numOfArray; i++) {
if (jimu[i] < divide) {
guardValue = guardValue + divide - jimu[i];
}
}
cout << guardValue << endl;
cin >> numOneLine;
} while (numOneLine != 0);
return 0;
}