#include <bits/stdc++.h>
using namespace std;
int top[100];
int siguma(int y) {
  int jkj = 0;
  for (int i = 0; i < y; i++) {
    jkj += top[i];
  }
  return jkj;
}
int main() {
  int n;
  int kijinedan, topnedan;
  cin >> n;
  cin >> kijinedan >> topnedan;
  int kiji;
  cin >> kiji;
  for (int i = 0; i < n; i++) {
    cin >> top[i];
  }
  sort(top, top + n, greater<int>());
  int k = 0;
  while (1) {
    if (top[k] * (topnedan * k + kijinedan) <= kijinedan * topnedan) {
      break;
    }
    if (k != 0) {
      if (top[k] * (topnedan * k + kijinedan) <=
          (kijinedan + siguma(k)) * topnedan) {
        break;
      }
    }
    k++;
  }
  int ans;
  if (k == 0) {
    ans = kiji / kijinedan;
  } else {
    ans = (kiji + siguma(k)) / (topnedan * k + kijinedan);
  }
  if ((ans + 1) * (topnedan * k + kijinedan) <= kiji + siguma(k)) {
    ans++;
  }
  cout << ans << endl;
  return 0;
}
