#include <bits/stdc++.h>
int main() {
  int n, kp, tp, kc, tc[101];
  int dc[101];
  scanf("%d%d%d%d", &n, &kp, &tp, &kc);
  int sumc = kc, sump = kp, i, j, tmp;
  for (i = 0; i < n; i++) {
    scanf("%d", &tc[i]);
  }
  for (i = 0; i < n; i++) {
    for (j = n - 1; j > i; j--) {
      if (tc[j - i] < tc[j]) tmp = tc[j];
      tc[j] = tc[j - 1];
      tc[j - 1] = tmp;
    }
  }
  for (i = 0; i < n; i++) {
    if (tc[i] / tp > kc / kp) {
      sump += 2;
      sumc += tc[i];
      dc[i] = sumc / sump;
      if (dc[i] < dc[i - 1]) printf("%d\n", dc[i]);
      break;
    } else
      printf("%d\n", kc / kp);
    break;
  }
  return 0;
}
