博客
关于我
A. Cheap Travel
阅读量:533 次
发布时间:2019-03-09

本文共 1453 字,大约阅读时间需要 4 分钟。

Ann has recently started commuting by subway. We know that a one ride subway ticket costs a rubles. Besides, Ann found out that she can buy a special ticket for m rides (she can buy it several times). It costs b rubles. Ann did the math; she will need to use subway n times. Help Ann, tell her what is the minimum sum of money she will have to spend to make n rides?

Input

The single line contains four space-separated integers n, m, a, b (1 ≤ n, m, a, b ≤ 1000) — the number of rides Ann has planned, the number of rides covered by the m ride ticket, the price of a one ride ticket and the price of an m ride ticket.

Output

Print a single integer — the minimum sum in rubles that Ann will need to spend.

Examples

inputCopy
6 2 1 2
outputCopy
6
inputCopy
5 2 2 3
outputCopy
8
Note
In the first sample one of the optimal solutions is: each time buy a one ride ticket. There are other optimal solutions. For example, buy three m ride tickets.

思路:模拟

写的时候被三组数据卡了,批评自己
10 3 5 1
101 110 1 100
100 8 10 1

#include
#include
#include
#include
#include
#include
//#include
using namespace std;typedef long long LL;int main(){ LL n, m, a, b; cin >> n >> m >> a >> b; if (n / m == 0) { if (b < a*n) cout << b << endl; else cout << a * n << endl; } else if (b*1.0 / m >= a) cout << n * a << endl; else { if(b<(n%m)*a) cout << n / m * b + b << endl; else cout << n / m * b + (n%m)*a << endl; } return 0;}

转载地址:http://vboiz.baihongyu.com/

你可能感兴趣的文章
MS Edge浏览器“STATUS_INVALID_IMAGE_HASH“兼容性问题
查看>>
ms sql server 2008 sp2更新异常
查看>>
MS UC 2013-0-Prepare Tool
查看>>
MSBuild 教程(2)
查看>>
msbuild发布web应用程序
查看>>
MSB与LSB
查看>>
MSCRM调用外部JS文件
查看>>
MSCRM调用外部JS文件
查看>>
MSEdgeDriver (Chromium) 不适用于版本 >= 79.0.313 (Canary)
查看>>
MsEdgeTTS开源项目使用教程
查看>>
msf
查看>>
MSSQL数据库查询优化(一)
查看>>
MSSQL数据库迁移到Oracle(二)
查看>>
MSSQL日期格式转换函数(使用CONVERT)
查看>>
MSTP多生成树协议(第二课)
查看>>
MSTP是什么?有哪些专有名词?
查看>>
Mstsc 远程桌面链接 And 网络映射
查看>>
Myeclipse常用快捷键
查看>>
MyEclipse更改项目名web发布名字不改问题
查看>>
MyEclipse用(JDBC)连接SQL出现的问题~
查看>>