A. Cheap Travel-白红宇

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

inputCopy

5 2 2 3

outputCopy

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/

你可能感兴趣的文章

nginx代理地图服务--离线部署地图服务（地图数据篇.4）