A9640 | Appleman and Toastman
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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?
- 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?
输入格式
The first line contains a single integer $n$ ( $1<=n<=3·10^{5}$ ). The second line contains $n$ integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $1<=a_{i}<=10^{6}$ ) — the initial group that is given to Toastman.
输出格式
Print a single integer — the largest possible score.
输入输出样例
输入 #1
3 3 1 5
输出 #1
26
输入 #2
1 10
输出 #2
10
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted