import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			int N = sc.nextInt(), A = sc.nextInt(), B = sc.nextInt(), X = sc.nextInt(), Y = sc.nextInt();
			int[] H = new int[N];
			for (int i = 0;i < N;++ i) H[i] = sc.nextInt();
			int ng = -1, ok = 1_000_000_000;
			while(ok - ng > 1) {
				int mid = ok + ng >> 1;
				int[] h = H.clone();
				int count = A;
				for (int i = 0;i < N;++ i) {
					h[i] = Math.max(0, h[i] - mid);
					int a = Math.min(count, h[i] / X);
					h[i] -= a * X;
					count -= a;
				}
				Arrays.sort(h);
				for (int i = 0;i < count;++ i) h[N - i - 1] = 0;
				long sum = 0;
				for (int i : h) sum += i;
				if ((long)B * Y >= sum) ok = mid;
				else ng = mid;
			}
			System.out.println(ok);
		}
	}
}