#include <set>
#include <cstdio>
#include <algorithm>
#include <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

inline int getInt(){ int s; scanf("%d", &s); return s; }

using namespace std;

int main(){
  int n = getInt();
  int a = getInt();
  int b = getInt();
  int c = getInt();
  vector<int> v;
  REP(i,n) v.push_back(getInt());
  sort(v.rbegin(), v.rend());

  int ans = c / a;
  REP(i,n){ c += v[i]; ans = max(ans, c / (a + b + i * b)); }

  printf("%d\n", ans);

  return 0;
}