#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;

int main()
{
  int a, b, c, d[100], n;

  cin >> n >> a >> b >> c;

  for (int i = 0; i < n; i++){
    cin >> d[i];
  }
  
  sort(d, d + n, greater<int>());

  for (int i = 0; i < n - 1; i++){
    d[i + 1] += d[i];
  }

  int max;
  max = c / a;

  for (int i = 0; i < n; i++){
    int e = (c + d[i]) / (a + (i * b) + b);
    if (max <= e){
      max = e;
    }
  }

  cout << max << endl;

  return 0;
}