CF#215DIV2:A. Sereja and Coat Rack
来源:互联网 发布:玩别人老婆知乎 编辑:程序博客网 时间:2024/06/06 00:16
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.
题意:旅店一共有n个衣架,有m个客人,每个客人来会选最便宜的衣架挂衣,旅店获得相应的收益,但是衣架不够的情况下要给每个客人赔款p
思路:水题,排序后分情况讨论即可
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ int n,d,m,i,j; int a[10000]; while(~scanf("%d%d",&n,&d)) { int s = 0; memset(a,0,sizeof(a)); int sum = 0; for(i = 0; i<n; i++) { scanf("%d",&a[i]); s+=a[i]; } sort(a,a+n); scanf("%d",&m); if(m==n) printf("%d\n",s); else if(m>n) { s-=(m-n)*d; printf("%d\n",s); } else if(m<n) { sum = 0; for(i = 0;i<m;i++) sum+=a[i]; printf("%d\n",sum); } } return 0;}
- CF#215DIV2:A. Sereja and Coat Rack
- A. Sereja and Coat Rack
- Codeforces 215A A.Sereja and Coat Rack
- 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
- I - 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【水】
- codeforce Sereja and Coat Rack(简单排序)
- CF#215DIV2:B. Sereja and Suffixes
- CF#215DIV2:C. Sereja and Algorithm
- CF#215 DIV2: B. Sereja and Suffixes
- CF#215DIV2:B. Sereja and Suffixes(哈希记录)
- CF 380A Sereja and Prefixes(二分)
- cf-381A-Sereja and Dima
- Django模板中的关闭和开启HTML自动转义,解析
- Sereja and Algorithm -----Codeforces Round #215 div.1 A
- Recursion 求所有子集 @CareerCup
- msys 编译 openresty 记录(失败)
- linux学习笔记--鸟哥的linux私房菜第0章 计算机概论
- CF#215DIV2:A. Sereja and Coat Rack
- protel的一些记录
- CF#215DIV2:B. Sereja and Suffixes
- CF#215DIV2:C. Sereja and Algorithm
- codeforces Round #215 div2 题解
- CodeForce Round 215 DIV2 C 使用了线段树 但是多此一举...
- Codeforces Round #215 (Div. 1)
- 六百链网络收藏夹 博客正式开通!
- 黑马程序员_HashCode_框架_配置文件