CodeForces - 417A(思维题)
2016-04-23 18:02
183 查看
Elimination
Submit Status
Description
The finalists of the "Russian Code Cup" competition in 2214 will be the participants who win in one of the elimination rounds.
The elimination rounds are divided into main and additional. Each of the main elimination rounds consists of c problems, the winners of the round are the first n people in the rating list. Each of the additional elimination rounds consists of d problems. The winner of the additional round is one person. Besides, k winners of the past finals are invited to the finals without elimination.
As a result of all elimination rounds at least n·m people should go to the finals. You need to organize elimination rounds in such a way, that at least n·m people go to the finals, and the total amount of used problems in all rounds is as small as possible.
Input
The first line contains two integers c and d (1 ≤ c, d ≤ 100) — the number of problems in the main and additional rounds, correspondingly. The second line contains two integers n and m (1 ≤ n, m ≤ 100). Finally, the third line contains an integer k (1 ≤ k ≤ 100) — the number of the pre-chosen winners.
Output
In the first line, print a single integer — the minimum number of problems the jury needs to prepare.
Sample Input
Input
Output
Input
Output
Source
RCC 2014 Warmup (Div. 2)
题意:有两种方案,判断一下选哪一种就行了。
Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Description
The finalists of the "Russian Code Cup" competition in 2214 will be the participants who win in one of the elimination rounds.
The elimination rounds are divided into main and additional. Each of the main elimination rounds consists of c problems, the winners of the round are the first n people in the rating list. Each of the additional elimination rounds consists of d problems. The winner of the additional round is one person. Besides, k winners of the past finals are invited to the finals without elimination.
As a result of all elimination rounds at least n·m people should go to the finals. You need to organize elimination rounds in such a way, that at least n·m people go to the finals, and the total amount of used problems in all rounds is as small as possible.
Input
The first line contains two integers c and d (1 ≤ c, d ≤ 100) — the number of problems in the main and additional rounds, correspondingly. The second line contains two integers n and m (1 ≤ n, m ≤ 100). Finally, the third line contains an integer k (1 ≤ k ≤ 100) — the number of the pre-chosen winners.
Output
In the first line, print a single integer — the minimum number of problems the jury needs to prepare.
Sample Input
Input
1 10 7 2 1
Output
2
Input
2 2 2 1 2
Output
0
Source
RCC 2014 Warmup (Div. 2)
题意:有两种方案,判断一下选哪一种就行了。
#include <iostream> #include <stdio.h> #include <stdlib.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; int a[200010]; main() { int c,d,n,m,k; cin>>c>>d>>n>>m>>k; int tem=n*m-k; if(tem<=0){cout<<0<<endl;} else { if((double)c/(double)n<(double)d) { int t=tem/n,sheng=tem-t*n,hh=sheng*d; if(hh<c) cout<<c*t+hh<<endl; else cout<<c*t+c<<endl; }else cout<<tem*d<<endl; } return 0; }
相关文章推荐
- Nginx压力测试工具之WebBench
- [Toddler's Bottle]-collision
- update-alternatives命令
- follow 开源项目关于NoClassDefFoundError错误的解决方法
- 19.fastDFS集群理解+搭建笔记
- 夺命雷公狗ThinkPHP项目之----企业网站8之栏目的添加完善(无限极分类的完成)
- CodeForces - 416A (判断大于小于等于 模拟题)
- opencv 图像的深度和通道
- 14_1到1000之间的完全数
- GIT 分支管理:创建与合并分支、解决合并冲突
- Codeforces 346C Number Transformation II 构造
- 作业:C++作业4
- 《NoSQL入门》关于NoSQL
- 使用boost库生成 随机数 随机字符串
- Cocos2dx: 使用ClippingNode的节点裁剪
- 用C语言做一个通讯录
- [WPF疑难]避免窗口最大化时遮盖任务栏
- CodeForces - 407A
- 普通函数,虚函数,纯虚函数
- R的数据结构