Sereja and Coat Rack(水)
2016-04-01 09:03
302 查看
Sereja and Coat Rack
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
Sereja owns a restaurant for n people. The restaurant hall has a coat rack with n hooks. Each restaurant visitor can use a hook to hang his clothes on it. Using the i-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 the m guests is visiting Sereja's restaurant tonight.
Input
The first line contains two integers n and d(1 ≤ n, d ≤ 100). The next line contains integers a1, a2, ..., an(1 ≤ ai ≤ 100). The third line contains integer m(1 ≤ m ≤ 100).
Output
In a single line print a single integer — the answer to the problem.
Sample Input
Input
Output
Input
Output
Hint
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.
题意:顾客挂衣服,每个称子可以挂一个衣服,每个钩子挂衣服所需要的价格不同,宾客会选便宜的 挂,钩子不够了房东要陪d元,现在有m个顾客,让求今晚房东收益;
代码:
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
Sereja owns a restaurant for n people. The restaurant hall has a coat rack with n hooks. Each restaurant visitor can use a hook to hang his clothes on it. Using the i-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 the m guests is visiting Sereja's restaurant tonight.
Input
The first line contains two integers n and d(1 ≤ n, d ≤ 100). The next line contains integers a1, a2, ..., an(1 ≤ ai ≤ 100). The third line contains integer m(1 ≤ m ≤ 100).
Output
In a single line print a single integer — the answer to the problem.
Sample Input
Input
2 1 2 1 2
Output
3
Input
2 1 2 1 10
Output
-5
Hint
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.
题意:顾客挂衣服,每个称子可以挂一个衣服,每个钩子挂衣服所需要的价格不同,宾客会选便宜的 挂,钩子不够了房东要陪d元,现在有m个顾客,让求今晚房东收益;
代码:
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; class clothes{ public: int n,d,m; int a[110]; clothes(int n,int d):n(n),d(d){ for(int i = 0; i < n; i++){ cin >> a[i]; } cin >> m; } int work(){ sort(a,a + n); for(int i = n; i < m; i++) a[i] = -d; int ans = 0; for(int i = 0; i < m; i++) ans += a[i]; return ans; } }; int main(){ int n,d; while(~scanf("%d%d", &n, &d)){ clothes _guest(n,d); cout << _guest.work() << endl; } return 0; }
相关文章推荐
- struts2中<s:select>标签的使用
- 浅析Motion Design
- 数组
- 10个基本的HTML5动画工具设计
- Hive(一个数据仓库)
- LinuxC高级编程——进程
- 【BZOJ1116】[POI2008]CLO【BFS】
- amixer 混音器音量保存
- 多线程
- BZOJ1051受欢迎的牛
- Java ConcurrentMap 源码分析
- PHP基础整理4
- 测试学习博客
- 复利计算--结对项目<04-11-2016> 1.0.0 lastest 阶段性完工~
- 详解Java中实现SHA1与MD5加密算法的基本方法
- spp_net 分类测试
- CentOS 7 中配置 mysql 5.7.11 Linux Generic
- ActionResult的其它返回值
- Ruby--加载文件--require和require_relative
- 多步骤多分步的组件StepJump