#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, A, B, base;
  cin >> n >> A >> B >> base;
  int topping[100];
  for (int i = 0; i < n; i++) cin >> topping[i];
  int ans = base / A;
  sort(topping, topping + n);
  for (int i = n - 1; i >= 0; i--) {
    if (ans < (base += topping[i]) / (A + B * (n - i)))
      ans = base / (A + B * (n - i));
    else
      break;
  }
  cout << ans << endl;
}
