p207.cpp
======================
#include <bits/stdc++.h>

using namespace std;

template<typename T1, typename T2>
ostream& operator<<(ostream& out, const pair<T1, T2>& x) {
    return out << x.first << ' ' << x.second;
}

template<typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& x) {
    return in >> x.first >> x.second;
}

template<typename T>
istream& operator>>(istream& in, vector<T>& a) {
    for(auto& x: a) {
        in >> x;
    }
    return in;
};

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& a) {
    for(auto x: a) {
        out << x << ' ';
    }
    return out;
};

int n, m, y;
vector<int> x;

void read() {
    cin >> n >> m >> y;
    x.resize(n);
    cin >> x;
}

void solve() {
    // x[i] / y = a[i] / m

    vector<int> a_floor(n), a_ceil(n);
    vector<double> delta(n);

    int sum_floor = 0;
    for(int i = 0; i < n; i++) {
        a_floor[i] = (x[i] * m) / y;
        a_ceil[i] = (x[i] * m + y - 1) / y;

        sum_floor += a_floor[i];
        if(a_floor[i] == a_ceil[i]) {
            continue;
        }

        double a_exact = (double)x[i] * m / y;
        delta[i] = -(a_exact - a_floor[i]) + (a_ceil[i] - a_exact);
    }

    int buffer = m - sum_floor;

    vector<int> perm(n);
    iota(perm.begin(), perm.end(), 0);
    sort(perm.begin(), perm.end(), [&](int i, int j) {
        return delta[i] < delta[j];
    });

    assert(buffer <= n);
    for(int i = 0; i < buffer; i++) {
        a_floor[perm[i]] = a_ceil[perm[i]];
    }

    cout << a_floor << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T = 1;
    // cin >> T;
    for(int test = 1; test <= T; test++) {
        read();
        // cout << "Case #" << test << ": ";
        solve();
    }

    return 0;
}

=================
statement.txt
======================
207. Robbers
time limit per test: 0.5 sec.
memory limit per test: 65536 KB
input: standard
output: standard



N robbers have robbed the bank. As the result of their crime they chanced to get M golden coins. Before the robbery the band has made an agreement that after the robbery i-th gangster would get Xi/Y of all money gained. However, it turned out that M may be not divisible by Y.

The problem which now should be solved by robbers is what to do with the coins. They would like to share them fairly. Let us suppose that i-th robber would get Ki coins. In this case unfairness of this fact is |Xi/Y-Ki/M|. The total unfairness is the sum of all particular unfairnesses. Your task as the leader of the gang is to spread money among robbers in such a way that the total unfairness is minimized.

Input
The first line of the input file contains numbers N, M and Y (1 ≤ N ≤ 1000, 1 ≤ M, Y ≤ 10000). N integer numbers follow - Xi (1 ≤ Xi ≤ 10000, sum of all Xi is Y).

Output
Output N integer numbers — Ki (sum of all Ki must be M), so that the total unfairness is minimal.

Sample test(s)

Input
3 10 4
1 1 2

Output
2 3 5
Author:	Andrew Stankevich
Resource:	Petrozavodsk Summer Trainings 2003
Date:	2003-08-23






=================
