Day 24 A. Cheap Travel

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

题目大致意思为：有n次需要坐地铁 你可以有两种选择 一种是每次花 a rubles 另一种是花 b rubles 可以做m次 求满足条件的最小花费是多少

#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#define ll long long
int sum[105];
using namespace std;
int main()
{
    int n, m;
    double a, b;
    int res = 0;
    cin >> n >> m >> a >> b;
    if (n < m)//如果所需要的乘车次数小于第二种票价次数 
    {
        res = min(b, n * a);
    }
    else if (a >= b / m)
    //如果每次花的价格比第二种票价折算后的每次花的价格高 那么先考虑第二种 若还有剩余则再比较两种
    {
        res = n / m * b;
        int x = n - n / m * m;
        if (x)
        {
            res += min(x * a, b);
        }
    }
    else
    //如果第一种比第二种折算后价格低 那么全部选择第一种
    {
        res = n * a;
    }
    cout << res << endl;
    return 0;
}