A9621 | Cheap Travel
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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?
输入格式
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.
输出格式
Print a single integer — the minimum sum in rubles that Ann will need to spend.
输入输出样例
输入 #1
6 2 1 2
输出 #1
6
输入 #2
5 2 2 3
输出 #2
8
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.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted