#include <bits/stdc++.h>

using namespace std;
#define int long long
const int MOD = 1000000007;
int mul(int a, int b) {
	double x = (double)a * (double)b;
	if (x > 3e18) {
		return 2e18 + 5;
	}
	return a * b;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, K, X, Y;
	cin >> N >> K >> X >> Y;
	vector<int> A(N);
	int sum = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		A[i] = (A[i] - 1 + K - 1) / K;
		sum += A[i];
	}
	sort(A.begin(), A.end());
	int res = (int)1 << 62;
	int l = 0;
	int c = 0;
	res = res, A.back() * Y;
	res = min(res, mul(sum, X));
	for (int i = 0; i < N; i++) {
		sum -= (A[i] - l) * (N - i);
		res = min(res, mul(sum, X) + A[i] * Y);

		l = A[i];
	}
	cout << res << endl;
}