#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
int n;
int A , R , M;
int h[100005];
ll check(int x)
{
ll up = 0 , dn = 0;
for (int i = 1 ; i <= n ; i ++)
{
if (h[i] < x)
up += (x - h[i]);
if (h[i] > x)
dn += (h[i] - x);
}
ll temp = min(up , dn);
up -= temp , dn -= temp;
ll res = 1ll *up * A + 1ll * dn * R + 1ll * temp * M;
return res;
}
int main(void)
{
cin >> n >> A >> R >> M;
M = min(A + R , M);
for (int i = 1 ; i <= n ; i ++)
cin >> h[i];
int l = 0 , r = 1e9;
while (l + 10 < r)
{
int mid1 = (l + r) >> 1;
int mid2 = (mid1 + r) >> 1;
if(check(mid1) > check(mid2))
l = mid1;
else
r = mid2;
}
ll res = 1e18;
for (int i = l ; i <= r ; i ++)
res = min(res, check(i));
cout << res << endl;
}