#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, A, B, C, D[100];
  cin >> n >> A >> B >> C;
  for (int i = 0; i < n; i++) {
    cin >> D[i];
  }
  sort(D, D + n);
  int ret = 0;
  int dp[100];
  dp[n - 1] = D[n - 1];
  for (int i = n - 1; i > 0; i--) {
    dp[i - 1] = dp[i] + D[i - 1];
    ret = max((C + dp[i]) / (A + (n - i) * B),
              max((C + dp[i - 1]) / (A + (n - i + 1) * B), C / A));
  }
  cout << ret << endl;
  return 0;
}
