#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a, b;
  cin >> a >> b;
  int c;
  cin >> c;
  int top[110] = {0};
  for (int i = 0; i < n; i++) cin >> top[i];
  sort(top, top + n);
  reverse(top, top + n);
  int mx = 0;
  mx = c / a;
  for (int i = 0; i < n; i++) {
    c += top[i];
    if (mx < c / (a + (b * (i + 1))))
      mx = c / (a + (b * (i + 1)));
    else
      break;
  }
  cout << mx << endl;
  return 0;
}
