#include <bits/stdc++.h>
using namespace std;
int d[10002];
int main() {
  int n, a, b, c;
  cin >> n >> a >> b >> c;
  for (int i = 0; i < n; i++) cin >> d[i];
  sort(d, d + n, greater<int>());
  int pr = a, kr = c;
  int best = c / a;
  for (int i = 0; i < n; i++) {
    pr += b;
    kr += d[i];
    if (kr / pr > best)
      best = kr / pr;
    else
      break;
  }
  cout << best << endl;
  return 0;
}
