Codeforces Educational Codeforces Round 31 - D - Boxes And Balls（哈夫曼）

D. Boxes And Balls

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Ivan has n different boxes. The first of them contains some balls of n different colors.

Ivan wants to play a strange game. He wants to distribute the balls into boxes in such a way that for every i (1 ≤ i ≤ n) i-th box will contain all balls with color i.

In order to do this, Ivan will make some turns. Each turn he does the following:

1. Ivan chooses any non-empty box and takes all balls from this box; 
2. Then Ivan chooses any k empty boxes (the box from the first step becomes empty, and Ivan is allowed to choose it), separates the balls he took on the previous step into k non-empty groups and puts each group into one of the boxes. He should put each group into a separate box. He can choose either k = 2 or k = 3. 

The penalty of the turn is the number of balls Ivan takes from the box during the first step of the turn. And penalty of the game is the total penalty of turns made by Ivan until he distributes all balls to corresponding boxes.

Help Ivan to determine the minimum possible penalty of the game!

Input

The first line contains one integer number n (1 ≤ n ≤ 200000) — the number of boxes and colors.

The second line contains n integer numbers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the number of balls with color i.

Output

Print one number — the minimum possible penalty of the game.

Examples

input

3
1 2 3

output

6

input

4
2 3 4 5

output

19

Note

In the first example you take all the balls from the first box, choose k = 3 and sort all colors to corresponding boxes. Penalty is 6.

In the second example you make two turns: 

1. Take all the balls from the first box, choose k = 3, put balls of color 3 to the third box, of color 4 — to the fourth box and the rest put back into the first box. Penalty is 14; 
2. Take all the balls from the first box, choose k = 2, put balls of color 1 to the first box, of color 2 — to the second box. Penalty is 5. 

Total penalty is 19.

题意：

1. 有n种球，每种球有ai个
2. 刚开始所有球都在第一个箱子里
3. 每次操作就是从一个非空的箱子中拿出其中所有的球，并找来2或3个空箱子（刚刚将球全部拿出的也可以），将拿出的球分为任意非空的几组放入各自的箱子中
4. Penalty是表示每次从箱子中拿出球的消耗，消耗等于拿出球的数量
5. 求将所有n种球分别放入对应的n个箱子中最小的Penalty是多少

思路：

1. 哈夫曼，逆向思维，从放好的状态推回到全部在同一个箱子的状态。
2. 每次最好就是合三份，这样可以使得结果最小
3. 满足每次合三份时，球的种类需要是3,5,7,9...
4. 不满足时加入一个个数为0的种类来使其满足

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
#define LL long long

using namespace std;

LL n,a,b,c,ans = 0;
priority_queue<LL,vector<LL>,greater<LL> >q;

int main()
{
    scanf("%lld",&n);
    for(int i=0;i<n;i++){
        scanf("%lld",&a);
        q.push(a);
    }
    if(n==1){
        printf("0\n");
        return 0;
    }
    if(n%2==0) q.push(0);
    while(q.size()>1){
        a = q.top();q.pop();
        b = q.top();q.pop();
        c = q.top();q.pop();
        ans += a + b + c;
        q.push(a+b+c);
    }
    printf("%lld\n",ans);
    return 0;
}