Codeforces Round 643 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

greedy

math

sortings

ternary search

*2100

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Restorer Distance

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou have to restore the wall. The wall consists of $$$N$$$ pillars of bricks, the height of the $$$i$$$-th pillar is initially equal to $$$h_{i}$$$, the height is measured in number of bricks. After the restoration all the $$$N$$$ pillars should have equal heights.

You are allowed the following operations:

- put a brick on top of one pillar, the cost of this operation is $$$A$$$;
- remove a brick from the top of one non-empty pillar, the cost of this operation is $$$R$$$;
- move a brick from the top of one non-empty pillar to the top of another pillar, the cost of this operation is $$$M$$$.

You cannot create additional pillars or ignore some of pre-existing pillars even if their height becomes $$$0$$$.

What is the minimal total cost of restoration, in other words, what is the minimal total cost to make all the pillars of equal height?

Input

The first line of input contains four integers $$$N$$$, $$$A$$$, $$$R$$$, $$$M$$$ ($$$1 \le N \le 10^{5}$$$, $$$0 \le A, R, M \le 10^{4}$$$) — the number of pillars and the costs of operations.

The second line contains $$$N$$$ integers $$$h_{i}$$$ ($$$0 \le h_{i} \le 10^{9}$$$) — initial heights of pillars.

Output

Print one integer — the minimal cost of restoration.

Examples

Input

3 1 100 100 1 3 8

Output

12

Input

3 100 1 100 1 3 8

Output

9

Input

3 100 100 1 1 3 8

Output

4

Input

5 1 2 4 5 5 3 6 5

Output

4

Input

5 1 2 2 5 5 3 6 5

Output

3

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/08/2023 21:13:29 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|