#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<ll, ll>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
ll bpow(ll b, ll p, ll m = 1000000007LL) {
  ll rt = 1;
  for (; p; p >>= 1, b = b * b % m)
    if (p & 1) rt = rt * b % m;
  return rt;
}
void solve() {}
ll a[200005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  ll x, f;
  cin >> x >> f;
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > x) {
      ans += f * ((a[i] - x) / (x + f) + ((a[i] - x) % (x + f) == 0 ? 0 : 1));
    }
  }
  cout << ans << endl;
}
