CodeForces 368A Sereja and Coat Rack
2016-01-15 11:02
253 查看
A. Sereja and Coat Rack
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
Input
Output
Input
Output
Note
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.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
Input
2 1 2 1 2
Output
3
Input
2 1 2 1 10
Output
-5
Note
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<iostream> #include<algorithm> using namespace std; int main(){ int n,d,m,i,sum,x; int num[110]; while(cin>>n>>d){ sum=0; x=0; for(i=0;i<n;i++){ cin>>num[i]; x+=num[i]; } cin>>m; if(m>n){ sum=x-(m-n)*d; } else if(m==n){ sum=x; } else if(m<n){ sort(num,num+n); for(i=0;i<m;i++){ sum+=num[i]; } } cout<<sum<<endl; } return 0; }
相关文章推荐
- vim乱码的解决
- Android开发--CardView使用
- (漫画)高效程序
- nefu 753 n!末尾有多少个0
- 【微信公众平台开发】利用百度接口,制作一键导航功能
- C# List 用法与示例
- javascript json属性用双引号还是单引号
- java对象构造过程
- 怎样在iMindMap 9中进行换行
- 数据挖掘领域10大挑战性问题:
- ImageMagick常用指令详解
- 关于环境变量
- python数字图像处理(13):基本形态学滤波
- 做出改变,不断改变。
- 数据结构 算法
- Bulb Switcher
- Linux RPM命令
- Android studio debug调试 解析
- Python包管理工具setuptools详解(基础)
- Lighttpd1.4.20源码分析 笔记 fdevent系统-结构体及对外接口