数组补全

数组补全

AcWing 3664
https://www.acwing.com/problem/content/description/3667/
贪心思想

代码

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

using namespace std;

int n,k,p,x,y;

int main()
{
    cin >> n >> k >> p >> x >> y;
    
    int sum = 0, lt = 0, ge = 0;
    for (int i = 1; i <= k; i ++ )
    {
        int t;
        cin >> t;
        sum += t;
        if (t < y) lt ++ ;
        else ge ++ ;
    }
    
    //cout << lt << ge << endl;
    int l = n / 2,r = n / 2 + 1;
    
    if (lt > l || ge > r) puts("-1");
    else
    {
        sum += (l -lt) + (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;
}