3664. 数组补全

Posted 2021-09-07 幽殇默

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
    int n, k, p, x, y;
    cin >> n >> k >> p >> x >> y;

    int sum = 0, lt = 0, ge = 0;
    for (int i = 0; i < k; i ++ )
    {
        int t;
        cin >> t;
        sum += t;
        if (t < y) lt ++ ;
        else ge ++ ;
    }

    int r = max(n / 2 + 1, ge), l = n - r;

    if (lt > l) puts("-1");
    else
    {
        sum += (l - lt) * 1 + (r - ge) * y;
        if (sum > x) puts("-1");
        else
        {
            for (int i = 0; i < l - lt; i ++ )
                cout << 1 << ' ';
            for (int i = 0; i < r - ge; i ++ )
                cout << y << ' ';
        }
    }

    return 0;
}