// competitive-verifier: PROBLEM #include #include #include /// @brief 累積和 template struct prefix_sum { prefix_sum(int _n) : n(_n), data(_n + 1) {} template prefix_sum(const std::vector &v) : n(v.size()), data(v.size() + 1) { for (int i = 0; i < n; ++i) data[i] = v[i]; build(); } void build() { for (int i = n - 1; i >= 0; --i) data[i] += data[i + 1]; } T get(int k) const { assert(0 <= k && k < n); return data[k] - data[k + 1]; } void set(int k, int x) { data[k] = x; } void add(int k, int x) { data[k] += x; } T sum(int r) const { assert(0 <= r && r <= n); return data[0] - data[r]; } T sum(int l, int r) const { assert(0 <= l && l <= r && r <= n); return data[l] - data[r]; } int min_left(T x) const { return min_left(0, x); } int min_left(int l, T x) const { assert(0 <= l && l <= n); int left = l, right = n + 1; while (right - left > 1) { int mid = (left + right) / 2; (data[l] - data[mid] >= x ? right : left) = mid; } return right; } int max_right(T x) const { return max_right(n, x); } int max_right(int r, T x) const { assert(0 <= r && r <= n); int left = -1, right = r; while (right - left > 1) { int mid = (left + right) / 2; (data[mid] - data[r] >= x ? left : right) = mid; } return left; } private: int n; std::vector data; }; #ifdef ATCODER #pragma GCC target("sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2") #endif #pragma GCC optimize("Ofast,fast-math,unroll-all-loops") #include #ifndef ATCODER #pragma GCC target("sse4.2,avx2,bmi2") #endif template constexpr bool chmax(T &a, const U &b) { return a < (T)b ? a = (T)b, true : false; } template constexpr bool chmin(T &a, const U &b) { return (T)b < a ? a = (T)b, true : false; } constexpr std::int64_t INF = 1000000000000000003; constexpr int Inf = 1000000003; constexpr double EPS = 1e-7; constexpr double PI = 3.14159265358979323846; #define FOR(i, m, n) for (int i = (m); i < int(n); ++i) #define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i) #define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i) #define rep(i, n) FOR (i, 0, n) #define repn(i, n) FOR (i, 1, n + 1) #define repr(i, n) FORR (i, n, 0) #define repnr(i, n) FORR (i, n + 1, 1) #define all(s) (s).begin(), (s).end() struct Sonic { Sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(20); } constexpr void operator()() const {} } sonic; using namespace std; using ll = std::int64_t; using ld = long double; template std::istream &operator>>(std::istream &is, std::pair &p) { return is >> p.first >> p.second; } template std::istream &operator>>(std::istream &is, std::vector &v) { for (T &i : v) is >> i; return is; } template std::ostream &operator<<(std::ostream &os, const std::pair &p) { return os << '(' << p.first << ',' << p.second << ')'; } template std::ostream &operator<<(std::ostream &os, const std::vector &v) { for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? "" : " ") << *it; return os; } template void co(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cout << head << '\n'; else std::cout << head << ' ', co(std::forward(tail)...); } template void ce(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n'; else std::cerr << head << ' ', ce(std::forward(tail)...); } void Yes(bool is_correct = true) { std::cout << (is_correct ? "Yes\n" : "No\n"); } void No(bool is_not_correct = true) { Yes(!is_not_correct); } void YES(bool is_correct = true) { std::cout << (is_correct ? "YES\n" : "NO\n"); } void NO(bool is_not_correct = true) { YES(!is_not_correct); } void Takahashi(bool is_correct = true) { std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n'; } void Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); } int main(void) { int n, k; ll x, y; cin >> n >> k >> x >> y; vector a(n); cin >> a; vector b(n); rep (i, n) b[i] = (a[i] - 2 + k) / k; sort(all(b), greater<>()); prefix_sum ps(b); ll ans = x * accumulate(all(b), 0ll); rep (i, n) { chmin(ans, x * (ps.sum(i) - b[i] * i) + y * b[i]); } co(ans); return 0; }