#include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

int N;
int A, B;
int C;
int D[110];

int main() {
  cin >> N >> A >> B >> C;
  for (int i=0; i<N; i++) {
    cin >> D[i];
  }
  sort(D, D+N);
  int s = C;
  int ans = (int)floor((double)C / (double)A);
  for (int k=0; k<N; k++) {
    s += D[N-1-k];
    ans = max(ans, (int)floor((double)s / (double)(A + (k+1)*B)));
  }
  cout << ans << "\n";
  return 0;
}