【CODEFORCES】 A. Cheap Travel

最新推荐文章于 2024-04-24 15:43:10 发布

原创最新推荐文章于 2024-04-24 15:43:10 发布 · 794 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#Codeforces #水水更健康 #模拟

Codeforces 同时被 3 个专栏收录

66 篇文章

订阅专栏

水水更健康

21 篇文章

订阅专栏

模拟

13 篇文章

订阅专栏

本文介绍了如何通过购买地铁票来最小化乘客的花费。详细解释了如何在单程票和多程票之间做出选择，以确保乘客在一定次数的乘车后花费最少。通过输入参数如计划乘车次数、多程票覆盖次数、单程票价格和多程票价格，本文提供了计算最优化票价的算法。

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 ntimes. 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.

Sample test(s)

input
6 2 1 2

output
6

input
5 2 2 3

output
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.

题解：这道题只要细心都没什么问题，主要在于最后那不满m次的车费是取单程票还是多程票，比较大小选取小的加到答案中就是最终的答案。水题不多说勒。

#include<iostream>
#include<cstdio>

using namespace std;
int n,m,a,b;
int main()
{
    scanf("%d%d%d%d",&n,&m,&a,&b);
    double t=a*1.0,p=(b*1.0)/m;
    if (t<=p) printf("%d",n*a);
    else
    {
        if ((n%m)*a<b) printf("%d",(n/m)*b+(n%m)*a);
        else printf("%d",(n/m)*b+b);
    }
    return 0;
}