voidsolve(){ int n, c, d; std::cin >> n >> c >> d;
std::vector<int> a(n); for (int i = 0; i < n; i++) { std::cin >> a[i]; }
std::sort(a.begin(), a.end());
int val = 0; i64 res = 1ll * n * c + d, num1 = 0; for (int i = 0; i < n; i++) { if(a[i] > val) { num1 += 1; val = a[i]; } res = std::min(res, 1ll * c * (n - num1) + 1ll * d * (a[i] - num1)); }