Codeforces Round #266 (Div. 2) A. Cheap Travel

A. Cheap Travel
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 nmab (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.

题解:题意为要坐n趟地铁,有一种是每一趟花a元,另一种是m趟花b元,问最小花费。

         1. 判断 a*m<b ,  最小花费为 n*a,否则  先算出 n 趟中有多少 m趟,  x = n/m;   余下 c 趟   c=n%m。 min = x*b;

         2.判断 余下的c趟所花费的钱,如果 b<c*a;  min += b; 否则 min+=c*a;

AC code:

/**
 * @(#)Travel.java
 *
 *
 *
 * @version 1.00 2014/9/13
 */
import java.util.*;
public class Travel {
        
   
    public static void main(String[] args) {
       
            int n,m,a,b,min=0;
            
            Scanner cin = new Scanner(System.in);
            
            n = cin.nextInt();
            m = cin.nextInt();
            a = cin.nextInt();
            b = cin.nextInt();
            
            if(a*m<=b)
            {
            	min = a*n;
            }
            else
            {
            	int x = n/m;
            	 min +=x*b;
            	 int c = n-x*m;
            	
            	if(b<=a*c)
            	{
            	    min+=b;	
            	}else
            	{
            		min+=a*c;
            	}
            	
            	
            }
            System.out.println (min);
            
    }
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值