C. Tea Party

// Problem: C. Tea Party
// Contest: Codeforces - Educational Codeforces Round 21
// URL: https://codeforces.com/problemset/problem/808/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-12 13:51:38
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	int n, m;
	cin >> n >> m;
	vector<int> a(n + 1), p ( n + 1);
	vector<pii> c;
	for (int i = 1; i <= n; i ++) {
		cin>> a[i];
		c.pb({a[i], i});
	}
	sort(all(c), [](pii a, pii b) {
		return a.fi > b.fi;
	});
	for (int i = 0; i < n; i ++) {
		int idx = c[i].se, re = c[i].fi+ 1 >> 1;
		if (m >= re) {
			m -= re;
			p[idx] = re;
		} 
		else {
			puts("-1");
			return;
		}
	}
	
	for (int i = 0; i < n; i ++) {
		int r = c[i].fi - p[c[i].se], idx = c[i].se;
		if (m >= r) {
			m -= r;
			p[idx] = a[idx];
		}
		else {
			p[idx] +=m;
			m = 0;
			break;
		}
	}
	

	for (int i =1; i<= n; i ++)
		cout << p[i] << ' ';
	puts("");
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

从大杯子到小杯子的去放。先放一半，然后再放剩余的