#include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
signed main() {
  int N, A, B, C;
  cin >> N >> A >> B >> C;
  int D[10000];
  for (int i = 0; i < (N); i++) {
    cin >> D[i];
  }
  sort(D, D + N);
  int ans = C / A;
  int calsum = 0;
  for (int i = (N - 1); i >= (0); i--) {
    calsum += D[i];
    if (ans < (C + calsum) / (A + B * (N - 1 - i))) {
      ans = (C + calsum) / (A + B * (N - 1 - i));
    } else {
      break;
    }
  }
  cout << ans << endl;
  int max_ = 0;
  return 0;
}
