CodeForces 466A Cheap Travel

CodeForces 466A  Cheap Travel

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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 Input

Input

6 2 1 2

Output

6

Input

5 2 2 3

Output

8

Hint

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.

#include<stdio.h>
int main(){
	int n,m,a,b;
	while(scanf("%d%d%d%d",&n,&m,&a,&b)!=EOF){
		if(b/m>a){
			printf("%d\n",n*a);
		}
		else{
			if(n%m==0){
				if((n/m)*b<=n*a){
					printf("%d\n",(n/m)*b);
				}
				else{
					printf("%d\n",n*a);
				}
			}
			else{
				if(((n/m)+1)*b<=((n/m)*b+(n%m)*a)&&((n/m)+1)*b<=n*a){
					printf("%d\n",((n/m)+1)*b);
				}
				else if(((n/m)+1)*b>((n/m)*b)&&((n/m)*b+(n%m)*a)<=n*a){
					printf("%d\n",((n/m)*b+(n%m)*a));
				}
				else{
					printf("%d\n",n*a);
				}
			}
		}
	}
	return 0;
}