Codeforces Round #263 (Div. 2) proC
来源:互联网 发布:斑马网络计划破解软件 编辑:程序博客网 时间:2024/05/23 01:58
题目:
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?
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.
Print a single integer — the largest possible score.
33 1 5
26
110
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.
题意分析:
代码:
#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <string>#include <iostream>using namespace std;long long a[300005];int main(){ int n; long long ans; while(scanf("%d",&n)!=EOF) { ans=0; for(int i=1;i<=n;i++) { cin>>a[i]; } sort(a+1,a+n+1); for(int i=1;i<=n;i++) { a[i]+=a[i-1]; } ans=a[n]; for(int i=0;i<=n-2;i++) { ans+=(a[n]-a[i]); } cout<<ans<<endl; }}
- Codeforces Round #263 (Div. 2) proC
- Codeforces Round #263 (Div. 2)
- Codeforces Round#263(Div.2)
- Codeforces Round #263 (Div. 2)
- Codeforces Round #263 (Div. 2)
- Codeforces Round #263 (Div. 2)
- Codeforces Round #263 (Div. 2) proA
- Codeforces Round #263 (Div. 2) proB
- Codeforces Round #263 (Div. 2) A-D
- Codeforces Round #263 (Div. 2) D
- Codeforces Round #263 (Div. 2) E
- 【索引】Codeforces Round #263 (Div. 2)
- Codeforces Round #263 (Div. 1)
- Codeforces Round #263 (Div. 1)
- Codeforces Round #102 (Div. 2)
- Codeforces Round #103 (Div. 2)
- Codeforces Round #103 (Div. 2)
- Codeforces Round #104 (Div. 2)
- 求二叉树中最远的距离
- Windows下更新MinGW
- 利用convert命令把硬盘格式FAT32转为NTFS(不影响硬盘数据哦)
- 统计学习那些事
- 带头结点链表的实现
- Codeforces Round #263 (Div. 2) proC
- android学习资源
- 用C# winform 编写一个计算器
- Red John Game
- 排序的时候一定要注意相等的情况。。
- [LeetCode OJ] Reverse Words in a String 解题报告
- Codeforces Round #263 (Div. 2)
- 2个有序链表的合并
- 如何使用Uglify2.js分析函数中的依赖项