c_cpp uva591

Posted 2021-05-14

#include <iostream>
#include <numeric>
#include <vector>
using namespace std;

size_t min_moves(const vector<size_t> &stacks)
{
    auto average = accumulate(stacks.begin(), stacks.end(), 0) / stacks.size();

    return accumulate(stacks.begin(), stacks.end(), 0, [average](size_t init, size_t value)
    {
        return init + (value > average ? value - average : 0);
    });
}

bool test_case(size_t case_num)
{
    size_t n;
    cin >> n;

    if (n == 0) return false;

    vector<size_t> stacks(n);
    for (auto &s : stacks) cin >> s;

    cout << "Set #" << case_num << endl;
    cout << "The minimum number of moves is " << min_moves(stacks) << "." << endl;
    cout << endl;

    return true;
}

int main()
{
    size_t num = 1;
    while (test_case(num++));
    return 0;
}