CodeForces 461A Appleman and Toastman
来源:互联网 发布:淘宝要不要买旺铺 编辑:程序博客网 时间:2024/05/16 04:41
CodeForces 461A Appleman and Toastman
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
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 Input
33 1 5
26
110
10
Hint
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.
#include<stdio.h>#include<algorithm>using namespace std;int main(){long long sum,n,i,j,s[444444];while(scanf("%lld",&n)!=EOF){sum=0;for(i=0;i<n;i++){scanf("%lld",&s[i]);sum+=s[i];}sort(s,s+n);if(n>1){for(i=0,j=1;i<n;i++){sum+=s[i]*j;if(i<n-2)j++;}}printf("%lld\n",sum);}}
- Codeforces-461A Appleman and Toastman
- Appleman and Toastman - CodeForces 461 A 水题
- Codeforces 461A Appleman and Toastman
- Codeforces 461A Appleman and Toastman(贪心)
- codeforces 461A Appleman and Toastman
- 【codeforces】 461A Appleman and Toastman
- CodeForces 461A Appleman and Toastman(贪心)
- CodeForces 461A Appleman and Toastman
- CodeForces 461A Appleman and Toastman
- codeforces 461A Appleman and Toastman
- 461A - Appleman and Toastman
- A. Appleman and Toastman(codeforces#263div1)
- A. Appleman and Toastman
- CF 461 A Appleman and Toastman
- 【CODEFORCES】 C. Appleman and Toastman
- Codeforces Round #263 (Div. 1) A. Appleman and Toastman
- CodeForces-462C Appleman and Toastman
- CodeForces 462C Appleman and Toastman 贪心
- Throwable类的详细解释
- ListView--Adapter内的onItemClick监听器四个arg参数
- redis 主从 配置和哨兵监控
- REST技术第四步 多个参数注解问题
- [资源贴] AChartEngin -Android 图形化报表 插件
- CodeForces 461A Appleman and Toastman
- Android开发笔记(四十七)Runnable接口实现多线程
- 一些API的使用
- no visible @interface for declares
- 遮挡剔除(Occlusion Culling)与视锥体剔除(Frustum Culling)是否可以同时起作用?()
- APUE学习笔记【3】
- 近期安排
- python基础:python的局部变量和全局变量
- openssl rsa