#include <bits/stdc++.h>
using namespace std;
int n;
int a, b;
int c;
vector<int> d;
int main() {
  scanf("%d %d %d %d", &n, &a, &b, &c);
  for (int i = 0; i < n; i++) {
    int t;
    scanf("%d", &t);
    d.push_back(t);
  }
  sort(d.rbegin(), d.rend());
  int ans = 0;
  for (int i = 0; i < n + 1; i++) {
    int cal;
    cal = c;
    for (int j = 0; j < i; j++) cal += d[j];
    cal /= a + b * i;
    if (ans < cal)
      ans = cal;
    else
      break;
  }
  printf("%d\n", ans);
  return 0;
}
