【codeforces 613B】【*2200】【二分】【思维】

http://codeforces.com/problemset/problem/613/B

【题意】

给你n个数，可以花费1使得数字加1，最大到A,最多花费m

最后n个数的最小值为min,为A的有k个，给你cm和cf

求force=min*cm+k*cf

【思路】

所求式中有两个未知量，可以固定一个变量，剩下的就满足单调性，继续二分另一个变量求最值

遍历固定k,假设k个数字将要加满到A,余下有m-k*A的花费

二分最大的最小值，看余下的花费是否可以填满小于最小的所有数

【代码】

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll maxn = 1e5 + 5;
pair<ll,ll> a[maxn];
ll sum[maxn];
ll b[maxn];
ll aas[maxn];
ll n, A, cf, cm, m;

ll find(ll left, ll R) {//R右端点
	ll l = 0, r = A, ans = 0;
	while (l <= r) {
		ll mid = (l + r) >> 1;//最小的价值
		ll p;//最小价值的个数

		p = upper_bound(b + 1, b + 1 + n, mid) - b - 1;
		if (p > R)p = R;
		if (p*mid - sum[p] <= left) {
			ans = mid;
			l = mid + 1;
		}
		else {
			r = mid - 1;
		}
	}
	return ans;
}

int main() {
	while (~scanf("%lld%lld%lld%lld%lld", &n, &A, &cf, &cm, &m)) {
		for (ll i = 1; i <= n; i++) {
			scanf("%lld", &a[i].first);
			a[i].second = i;
		}
		sort(a + 1, a + 1 + n);
		for (ll i = 1; i <= n; i++) {
			sum[i] = sum[i - 1] + a[i].first;
			b[i] = a[i].first;
		}
		ll ans = -1;
		ll ansA, ansL;
		for (ll i = 0; i <= n; i++) {
			ll p = A * i - (sum[n] - sum[n - i]);
			if (p <= m) {
				ll res = find(m - p, n - i);
				if(cm*res+cf*i>ans){
					ans = cm * res + cf * i;
					ansA = i;
					ansL = res;
				}
			}
		}
		printf("%lld\n", ans);
		for (ll i = 1; i <= n; i++) {
			if (i > n - ansA)aas[a[i].second] = A;
			else if (a[i].first <= ansL)aas[a[i].second] = ansL;
			else {
				aas[a[i].second] = a[i].first;
			}
		}
		for (ll i = 1; i <= n; i++) {
			printf("%lld ", aas[i]);
		}
		puts("");
	}
}