Codeforces Round #215 (Div. 2) -A. Sereja and Coat Rack
来源:互联网 发布:淘宝卖家违规几次封号 编辑:程序博客网 时间:2024/06/05 13:24
Sereja owns a restaurant for n people. The restaurant hall has a coat rack withn hooks. Each restaurant visitor can use a hook to hang his clothes on it. Using thei-th hook costs ai rubles. Only one person can hang clothes on one hook.
Tonight Sereja expects m guests in the restaurant. Naturally, each guest wants to hang his clothes on an available hook with minimum price (if there are multiple such hooks, he chooses any of them). However if the moment a guest arrives the rack has no available hooks, Sereja must pay a d ruble fine to the guest.
Help Sereja find out the profit in rubles (possibly negative) that he will get tonight. You can assume that before the guests arrive, all hooks on the rack are available, all guests come at different time, nobody besides them guests is visiting Sereja's restaurant tonight.
The first line contains two integers n andd (1 ≤ n, d ≤ 100). The next line contains integersa1,a2,..., an(1 ≤ ai ≤ 100). The third line contains integerm (1 ≤ m ≤ 100).
In a single line print a single integer — the answer to the problem.
2 12 12
3
2 12 110
-5
In the first test both hooks will be used, so Sereja gets 1 + 2 = 3 rubles.
In the second test both hooks will be used but Sereja pays a fine 8 times, so the answer is 3 - 8 = - 5.
题意说是有个叫Sereja的屌丝开了个饭馆,饭馆里有n个钩子,每个钩子放衣服得花ai元、若来的客人多了,钩子就不够挂衣服了,这个人就得支付给每个不能挂衣服的客人每人d元,问这个屌丝最大收益(可能为负值。)
#include<iostream>#include<string.h>#include<stdio.h>#include<ctype.h>#include<algorithm>#include<stack>#include<queue>#include<set>#include<math.h>#include<vector>#include<map>#include<deque>#include<list>using namespace std;int main(){ int n,d,m; int a[105]; int w=0; while(scanf("%d%d",&n,&d)!=EOF) { int sum=0; for(int i=0; i<n; i++) { scanf("%d",&a[i]); sum+=a[i]; } scanf("%d",&m); sort(a,a+n); if(m>n) w=sum-(m-n)*d; else { for(int j=0; j<m; j++) { w+=a[j]; } } printf("%d\n",w); } return 0;}
- Codeforces Round #215 (Div. 2) -A. Sereja and Coat Rack
- Codeforces Round #215 (Div. 2) A. Sereja and Coat Rack
- CodeForces 368A Sereja and Coat Rack
- Codeforces 215A A.Sereja and Coat Rack
- A. Sereja and Coat Rack
- Codeforces 368A Sereja and Coat Rack(模拟)
- CodeForces - 368A Sereja and Coat Rack (水)
- CodeForces 368A-Sereja and Coat Rack【队列】
- CodeForces 368A:Sereja and Coat Rack【水】
- CF#215DIV2:A. Sereja and Coat Rack
- I - Sereja and Coat Rack
- codeforce Sereja and Coat Rack(简单排序)
- Sereja and Algorithm -----Codeforces Round #215 div.1 A
- 【瞎搞】 Codeforces Round #215 (Div. 1) A Sereja and Algorithm
- Codeforces Round #223 (Div. 2)--A. Sereja and Dima
- Codeforces Round #223 (Div. 2)A. Sereja and Dima&&B. Sereja and Stairs
- Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
- Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
- 使用ifstream和getline读取文件内容[c++]
- tool
- Java代码优化编程
- 写给妹妹的编程札记 5 - 搜索: 迷宫问题 - 广度优先搜索
- Android之Content Providers
- Codeforces Round #215 (Div. 2) -A. Sereja and Coat Rack
- [ javascript ] UEditor单独图片上传组件!适用IE,Chrome,firefox.
- 换行符 \n\r
- SQLiteDatabase中query、insert、update、delete方法参数说明
- java中volatile关键字的含义
- Java 不同版本更新总结
- struts2整合JFreechart 饼图、折线图、柱形图
- HTTP POST GET 本质区别详解
- 泛型编程笔记(re迭代)