CodeForces 368A
2016-01-15 17:06
399 查看
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Description
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.
Input
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).
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.
& %I64u
Description
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.
Input
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).
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.
#include<stdio.h> #include<iostream> #include<algorithm> using namespace std; int main() { int m,n,d,a[111],i,ans=0; cin>>n>>d; for(i=0;i<n;i++) { cin>>a[i]; } sort(a,a+n); cin>>m; if(m<=n) { for(i=0;i<m;i++) { ans+=a[i]; } } else { for(i=0;i<n;i++) { ans+=a[i]; } ans=ans-(m-n)*d; } cout<<ans<<endl; return 0; }
相关文章推荐
- 继承ImageView的工具类,类似于QQ的圆形头像
- Intellij IDEA + Android SDK + Genymotion Emulator打造最佳Android开发环境
- 互联网是很强大的
- postman中 form-data、x-www-form-urlencoded、raw、binary的区别
- [Magento SQL] 获取订单 总金额,总Qty,并排除 指定客户Email的订单
- DJANGO输出HIGHCHARTS数据的样例
- 加密解密,关键点
- start_stop_time
- 图解linux安装tomcat(附常用命令)
- 使用Python发送http post请求上传文件
- 矩阵连乘最优解
- Node.js_Get和Post
- Http Digest认证协议
- union和union all的区别
- pppd 源码修改1
- IFeatureDataConverter2之三——导出指定字段的Shape
- 安装4.x版本的express开发框架
- t2712:字符串移位包含问题
- Android通过Webservice操作sqlserver数据库实例代码
- MFC中ActiveX控件的使用