100800: [AtCoder]ABC080 A - Parking

Memory Limit：256 MB Time Limit：2 S
Judge Style：Text Compare Creator：
Submit：0 Solved：0

Description

Score : $100$ points

Problem Statement

You are parking at a parking lot. You can choose from the following two fee plans:

  • Plan $1$: The fee will be $A×T$ yen (the currency of Japan) when you park for $T$ hours.
  • Plan $2$: The fee will be $B$ yen, regardless of the duration.

Find the minimum fee when you park for $N$ hours.

Constraints

  • $1≤N≤20$
  • $1≤A≤100$
  • $1≤B≤2000$
  • All input values are integers.

Input

Input is given from Standard Input in the following format:

$N$ $A$ $B$

Output

When the minimum fee is $x$ yen, print the value of $x$.

Sample Input 1

7 17 120

Sample Output 1

119
  • If you choose Plan $1$, the fee will be $7×17=119$ yen.
  • If you choose Plan $2$, the fee will be $120$ yen.

Thus, the minimum fee is $119$ yen.

Sample Input 2

5 20 100

Sample Output 2

100

The fee might be the same in the two plans.

Sample Input 3

6 18 100

Sample Output 3

100

Input

题意翻译

#### **题目描述** ## 你要去停车，你停了N个小时，现在有两种收费方法： ### 1、停放N小时，收费A×N元； ### 2、收费B元。 #### 当你停车了N小时时，请问最低停车费是多少 #### **输入格式** ### 一行，三个整数N，A，B ### **输出格式** ### 一行，一个整数x（表示最少用x元） ### **样例** 样例输入1 ``` 7 17 120 ``` 样例输出1 ``` 119 ``` 样例输入2 ``` 5 20 100 ``` 样例输出2 ``` 100 ``` 样例输入3 ``` 6 18 100 ``` 样例输出3 ``` 100 ```

Source/Category

加入题单

算法标签：