#include #pragma GCC target("avx2") #pragma GCC optimize("O2") #pragma GCC optimize("unroll-loops") using namespace std; typedef string::const_iterator State; class ParseError {}; // using mint = long double; // using mint = atcoder::modint998244353; // using mint = atcoder::modint1000000007; typedef long long ll; typedef pair P; typedef pair T; typedef pair> Pd; const ll INF = 3e18; const ll fact_table = 8000050; /* priority_queue pql; priority_queue

pqp; // big priority queue // priority_queue, greater> pqls; priority_queue, greater

> pqps; // small priority queue // top pop */ ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1}; ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1}; //↓,→,↑,← #define p(x) cout << x << "\n"; #define el cout << "\n"; #define pe(x) cout << x << " "; #define ps(x) cout << fixed << setprecision(25) << x << endl; #define pu(x) cout << (x); #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define rep(i, n) for (ll i = 0; i < (n); i++) #define rep2(i, a, b) for (ll i = a; i <= (b); i++) #define rep3(i, a, b) for (ll i = a; i >= (b); i--) #define all(c) begin(c), end(c) #define sorti(v) sort(all(v)) #define sortd(v) \ sort(all(v)); \ reverse(all(v)); #define SUM(v) accumulate(all(v), 0LL) #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) typedef vector vec; typedef vector> mat; // vec v(n) -> 長さnのベクトルを宣言 // mat dp(h, vec(w)) -> h * w の行列を宣言 const ll mod = 1000000007ll; // const ll mod = 998244353ll; ll mypow(ll a, ll b, ll m = mod) { ll x = 1; while (b) { while (!(b & 1)) { (a *= a) %= m; b >>= 1; } (x *= a) %= m; b--; } return x; } vec rv(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res; } vec fact, rfact; void c3_init() { fact.resize(fact_table + 5); rfact.resize(fact_table + 5); fact[0] = rfact[0] = 1; for (ll i = 1; i <= fact_table; i++) { fact[i] = (fact[i - 1] * i) % mod; } rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod); for (ll i = fact_table; i >= 1; i--) { rfact[i - 1] = rfact[i] * i; rfact[i - 1] %= mod; } return; } ll c3(ll n, ll r) { assert(n >= 0); assert(r >= 0); assert(n >= r); return fact[n] * rfact[r] % mod * rfact[n - r] % mod; } bool icpc = false; bool multicase = false; // 配列の長さ足りていますか? ll n, m, a, b, x, y; ll h, w; bool calc(ll k, vec &h) { vec hh(n); rep(i, n) { hh[i] = max(0ll, h[i] - k); } ll canuse = 0; rep(i, n) { canuse += hh[i] / x; } canuse = min(canuse, a); ll ares = a - canuse; sorti(hh); if (ares >= n) return true; ll sum = 0; if (ares) { rep(i, n) { hh[i] = hh[i] % x; } sorti(hh); rep(i, n - ares) { sum += hh[i]; } } else { rep(i, n) { sum += hh[i]; } } return sum <= b * y + canuse * x; } bool solve() { cin >> n >> a >> b >> x >> y; vec h = rv(n); ll ok = MAX(h), ng = -1; while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; if (calc(mid, h)) { ok = mid; } else { ng = mid; } } p(ok); return true; } /* */ int main() { // ios::sync_with_stdio(false); // cin.tie(nullptr); if (icpc) { while (solve()) ; return 0; } ll q, testcase = 1; if (multicase) { cin >> q; } else { q = 1; } while (q--) { // cout << "Case #" << testcase << ": "; solve(); testcase++; } // solve(); return 0; }