#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
signed main(){
  ll N,a,b,X,Y;cin>>N>>a>>b>>X>>Y;
  vector<ll>h(N);REP(i,N)cin>>h[i];
  ll l=0,r=1e18;
  while(l!=r){
    ll m=(l+r)/2,A=a,B=b;
    vector<ll>H(N);
    REP(i,N)H[i]=max(0LL,h[i]-m);
    REP(i,N){
      ll c=min(H[i]/X,A);
      H[i]-=X*c;A-=c;
    }
    sort(ALL(H));reverse(ALL(H));
    REP(i,N)if(A&&H[i]){
      H[i]=0;A--;
    }
    ll sum=0;
    REP(i,N)sum+=H[i];
    if(sum>B*Y)l=m+1;
    else r=m;
  }
  cout<<l<<endl;
  return 0;
}