BestCoder 1st Anniversary
2015-07-25 20:06
363 查看
Souvenir
Accepts: 1078Submissions: 2366
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 262144/262144 K (Java/Others)
Problem Description
Today is the 1st anniversary of BestCoder. Soda, the contest manager, wants to buy a souvenir for each contestant. You can buy the souvenir one by one or set by set in the shop. The price for a souvenir is p yuan
and the price for a set of souvenirs if q yuan.
There's m souvenirs
in one set.
There's n contestants
in the contest today. Soda wants to know the minimum cost needed to buy a souvenir for each contestant.
Input
There are multiple test cases. The first line of input contains an integer T (1≤T≤105),
indicating the number of test cases. For each test case:
There's a line containing 4 integers n,m,p,q (1≤n,m,p,q≤104).
Output
For each test case, output the minimum cost needed.
Sample Input
2 1 2 2 1 1 2 3 4
Sample Output
1 3 Hint For the first case, Soda can use 1 yuan to buy a set of 2 souvenirs. For the second case, Soda can use 3 yuan to buy a souvenir.
BestCoder周年纪念赛,趁着还没结束,来一发水题题解(其实是卡题了(/ □ \)囧)
#include <iostream> #include <stdio.h> using namespace std; int main() { int n,m,p,q,T,flag; scanf("%d",&T); while(T--) { scanf("%d%d%d%d",&n,&m,&p,&q); if(n<=m) flag = min(p*n,q); else { if(p<=q/m) flag = n*p; else { int x = n/m*q; int y = (n-n/m*m)*p; int z = (n/m+1)*q; flag = min(x+y,z); } } printf("%d\n",flag); } return 0; }
相关文章推荐
- day07--Map键值对
- ZOJ - 2207 Team Rankings(待ac)
- 【Mongodb】用户和认证 权限总结
- 小白学开发(iOS)OC_面向对象总结(2015-07-25)
- 小说题目和章节题目还没想好
- hdu 3517 Adopt or not(二分图最大独立集关键点)
- C++类保护函数外部调用
- 南方CASS快捷键
- Java TCP 程序
- 关于recycle.exe病毒的查杀
- 杭电OJ-1874_畅通工程续
- arm-linux-gcc的安装
- 最简单的基于FFmpeg的移动端例子附件:Android 自带播放器
- Android操作SQLite数据库基本模式
- HEAP CORRUPTION DETECTED
- UOJ #78 二分图最大匹配
- C++入门经典 笔记(第七章)使用数组和字符串存储信息
- Android空指针异常或许只是一个简单的小失误
- 《深入理解java虚拟机》:类的初始化
- Android 图像压缩,和LRU算法使用的推荐链接