#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, a_, b, x, y; cin >> n >> a_ >> b >> x >> y;
  vector<int> h_(n); REP(i, n) cin >> h_[i];
  int lb = -1, ub = *max_element(ALL(h_));
  while (ub - lb > 1) {
    int mid = (lb + ub) / 2, a = a_;
    vector<int> h(n);
    REP(i, n) h[i] = max(h_[i] - mid, 0);
    REP(i, n) {
      int magic = min(h[i] / x, a);
      h[i] -= x * magic;
      a -= magic;
    }
    if (a > 0) {
      vector<int> ord(n);
      iota(ALL(ord), 0);
      sort(ALL(ord), [&](int l, int r) -> bool { return h[l] > h[r]; });
      REP(i, n) {
        if (a > 0) {
          h[ord[i]] = 0;
          --a;
        }
      }
    }
    (accumulate(ALL(h), 0LL) <= 1LL * y * b ? ub : lb) = mid;
  }
  cout << ub << '\n';
  return 0;
}