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

int main(){
  int n;
  int A, B, C;
  int t[102];

  while(cin >> n >> A >> B >> C){
    for(int i = 0; i < n; i++){
      cin >> t[i];
    }
    sort(t, t + n, greater<int>());

    int maxCal = C / A;
    int sumCal = C;

    for(int i = 0; i < n; i++){
      sumCal += t[i];
      maxCal = max(maxCal, sumCal / (A + (i + 1) * B));
    }

    cout << maxCal << endl;
  }
}