#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  int A, B;
  cin >> A >> B;
  int w;
  cin >> w;
  vector<int> v(N);
  for (int i = 0; i < N; i++) cin >> v[i];
  sort(v.begin(), v.end(), greater<int>());
  int c = 0, ans = w / A;
  for (int i = 0; i < N; i++) {
    int tmp = (w + c + v[i]) / (A + (i + 1) * B);
    if (tmp > ans) {
      c += v[i];
      ans = tmp;
    } else
      break;
  }
  cout << ans << endl;
  return 0;
}
