Codeforces Round #263 (Div. 2) C. Appleman and Toastman（贪心）

C. Appleman and Toastman

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Appleman and Toastman play a game. Initially Appleman gives one group of n numbers to the Toastman, then they start to complete the following tasks:

• Each time Toastman gets a group of numbers, he sums up all the numbers and adds this sum to the score. Then he gives the group to the Appleman.
• Each time Appleman gets a group consisting of a single number, he throws this group out. Each time Appleman gets a group consisting of more than one number, he splits the group into two non-empty groups (he can do it in any way) and gives each of them to Toastman.

After guys complete all the tasks they look at the score value. What is the maximum possible value of score they can get?

Input

The first line contains a single integer n (1 ≤ n ≤ 3·105). The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the initial group that is given to Toastman.

Output

Print a single integer — the largest possible score.

Sample test(s)

input

3
3 1 5

output

26

input

1
10

output

10

Note

Consider the following situation in the first example. Initially Toastman gets group [3, 1, 5] and adds 9 to the score, then he give the group to Appleman. Appleman splits group [3, 1, 5] into two groups: [3, 5] and [1]. Both of them should be given to Toastman. When Toastman receives group [1], he adds 1 to score and gives the group to Appleman (he will throw it out). When Toastman receives group [3, 5], he adds 8 to the score and gives the group to Appleman. Appleman splits [3, 5] in the only possible way: [5] and [3]. Then he gives both groups to Toastman. When Toastman receives [5], he adds 5 to the score and gives the group to Appleman (he will throws it out). When Toastman receives [3], he adds 3 to the score and gives the group to Appleman (he will throws it out). Finally Toastman have added 9 + 1 + 8 + 5 + 3 = 26 to the score. This is the optimal sequence of actions.

题解：

一开始感觉读完题后不太明白题意，但是在读完下面的NOTE后就明白题意了，这里就不多说了，做法很简单就是简单的贪心，每一次都扔掉最小的，然后会发现一个规律，对于升序的数列a[0]  a[1]  a[2]  ..........a[n-3]  a[n-2]  a[n-1]  而言相应的位置相加的次数是;2,3,4............n-1,n,n;然后相应位置相乘相加就好了，注意会超出int范围

题目链接：http://codeforces.com/contest/462/problem/C

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;

LL num[330000];

int main(){
    LL n;
    scanf("%I64d",&n);
    for(LL i=0;i<n;i++){
        scanf("%I64d",&num[i]);
    }
    sort(num,num+n);
    LL ans=0;
    for(LL i=0;i<n-1;i++){
        ans=ans+num[i]*(i+2);
    }
    ans+=num[n-1]*n;
    printf("%I64d\n",ans);
    return 0;
}