Devu, the Dumb Guy
来源:互联网 发布:linux 图形安装 kvm 编辑:程序博客网 时间:2024/05/01 02:39
Description
Devu is a dumb guy, his learning curve is very slow. You are supposed to teach himn subjects, the ith subject hasci chapters. When you teach him, you are supposed to teach all the chapters of a subject continuously.
Let us say that his initial per chapter learning power of a subject is x hours. In other words he can learn a chapter of a particular subject inx hours.
Well Devu is not complete dumb, there is a good thing about him too. If you teach him a subject, then time required to teach any chapter of the next subject will require exactly 1 hour less than previously required (see the examples to understand it more clearly). Note that his per chapter learning power can not be less than 1 hour.
You can teach him the n subjects in any possible order. Find out minimum amount of time (in hours) Devu will take to understand all the subjects and you will be free to do some enjoying task rather than teaching a dumb guy.
Please be careful that answer might not fit in 32 bit data type.
Input
The first line will contain two space separated integers n, x (1 ≤ n, x ≤ 105). The next line will containn space separated integers: c1, c2, ..., cn (1 ≤ ci ≤ 105).
Output
Output a single integer representing the answer to the problem.
Sample Input
2 34 1
11
4 25 1 2 1
10
3 31 1 1
6
Hint
Look at the first example. Consider the order of subjects: 1, 2. When you teach Devu the first subject, it will take him3 hours per chapter, so it will take 12 hours to teach first subject. After teaching first subject, his per chapter learning time will be2 hours. Now teaching him second subject will take 2 × 1 = 2 hours. Hence you will need to spend 12 + 2 = 14 hours.
Consider the order of subjects: 2, 1. When you teach Devu the second subject, then it will take him 3 hours per chapter, so it will take 3 × 1 = 3 hours to teach the second subject. After teaching the second subject, his per chapter learning time will be2 hours. Now teaching him the first subject will take2 × 4 = 8 hours. Hence you will need to spend 11 hours.
So overall, minimum of both the cases is 11 hours.
Look at the third example. The order in this example doesn't matter. When you teach Devu the first subject, it will take him3 hours per chapter. When you teach Devu the second subject, it will take him2 hours per chapter. When you teach Devu the third subject, it will take him1 hours per chapter. In total it takes 6 hours.
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int num[1000010];int main(){ long long int n,i,x,sum; while(cin>>n>>x){ sum=0; for(i=0;i<n;i++){ cin>>num[i]; } sort(num,num+n); for(i=0;i<n;i++){ sum+=num[i]*x; if(x>1){ x--; } } cout<<sum<<endl; } return 0;}
- Devu, the Dumb Guy
- B. Devu, the Dumb Guy
- B. Devu, the Dumb Guy
- Codeforces 439B Devu, the Dumb Guy
- Codeforces 439 B. Devu, the Dumb Guy
- CodeForces 439B Devu, the Dumb Guy
- CodeForces 439B Devu, the Dumb Guy
- Codeforces 439B Devu, the Dumb Guy
- Codeforces 439B Devu, the Dumb Guy(贪心)
- Codeforces Round #251 (Div. 2) 439B Devu, the Dumb Guy(贪心)
- Codeforces Round #251(Div. 2) 439B. Devu, the Dumb Guy 贪心
- The first guy
- I'm the new guy here
- A. I Wanna Be the Guy
- 469A - I Wanna Be the Guy
- 【CodeForces】A. I Wanna Be the Guy
- Make Anonymous be the lucky guy
- Codeforces I Wanna Be the Guy
- 泛型
- JS----table 简单的查找并标注
- SVN常用命令
- C++ 顺序栈类实现
- python中的异常
- Devu, the Dumb Guy
- 多线程问题
- 单例模式
- Caffe傻瓜系列(3):激活层(Activiation Layers)及参数
- iOS如何将App程序发布到App Store?
- iOS中的label加载HTML文件
- linux网络编程
- [Android实例] 仿Win8磁铁效果,能够拖动改变Merto位置
- 使用Redis的Java客户端Jedis