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

int N;
int A, B, 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, greater<int>());
  int ans = 0, t = C;
  for (int i=0; i<N; i++) {
    t += D[i];
    ans = max(ans, t / (A + (i+1)*B));
  }
  cout << ans << "\n";
  return 0;
}