Cheap Travel（暴力求解法）

最新推荐文章于 2023-02-10 15:30:00 发布

JobsandCzj

最新推荐文章于 2023-02-10 15:30:00 发布

阅读量2k

点赞数 1

分类专栏： ACM-算法与刷题文章标签： ACM算法暴力求解法

本文链接：https://blog.csdn.net/jobsandczj/article/details/49962095

版权

ACM-算法与刷题专栏收录该内容

45 篇文章 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 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.

题目大意：要做n趟旅行，有一种票一张可做m趟旅行，有一种票只能做一次旅行，价格分别为a，b

解题思路：由于数据量小，可直接暴力求解

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

#define MAX_N 1000005//可由数据推得最大票价不会超过这个数

int n,m,a,b,ans;

int main()
{
	while(cin>>n>>m>>a>>b)
	{
		ans=MAX_N;
		for(int i=0;i<=n;i++)
		{
			int j=(n-i)/m + bool((n-i)%m);
			
			ans = min(ans,i*a+j*b);
		}
		
		cout<<ans<<endl;
	}
	return 0;
}