#include using namespace std; using ll = long long; using ld = long double; using V = vector; using VV = vector; using VVV = vector; using VS = vector; using VB = vector; using VVB = vector; using P = pair; using M = map; using Q = queue; using PQ = priority_queue; using PQG = priority_queue>; using S = set; using VP = vector

; const ll MOD = 1000000007; const ll mod = 998244353; const ll INF = 1LL << 60; #define rep(i,n) for(ll i = 0; i < n; i++) #define rep2(i,s,n) for(ll i = s; i < n; i++) #define per(i,n) for(ll i = n-1; i >= 0; i--) #define per2(i,s,n) for(ll i = n-1; i >= s; i--) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define fi first #define se second #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define lb lower_bound #define ub upper_bound templatebool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;} templatebool chmax(T&a, const T&b){if(avoid Vin(vector&a){rep(i,(int)a.size())cin>>a[i];} templatevoid Vout(const vector&a){rep(i,(int)a.size())cout<0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;} const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0}; int main() { ll n, aa, b, x, y; cin >> n >> aa >> b >> x >> y; V hh(n); Vin(hh); sort(rall(hh)); ll wa = 0, ac = 1000000000; while(ac-wa > 1) { ll mid = (wa+ac)/2, a = aa; V h(n); rep(i,n) h[i] = max(hh[i]-mid,0LL); //if (mid == 5) rep(i,n) cout << h[i] << endl; bool frag = 0; ll i = 0; while(a) { if(h[i] < x) break; ll c = min(h[i]/x,a); h[i] -= c*x; a -= c; i++; } sort(rall(h)); ll sum = 0; //if (mid == 5) rep(i,n) cout << h[i] << endl; rep2(j,a,n) { if(h[j] <= 0) break; sum += h[j]; if(sum > y*b) { frag = 1; break; } } if(frag) wa = mid; else ac = mid; //cout << mid << endl; } cout << ac << endl; }