AtCoder Beginner Contest 080
翻译中…
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$.
翻译中…
样例
Input #1
7 17 120
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.
Input #2
5 20 100
Output #2
100
The fee might be the same in the two plans.
Input #3
6 18 100
Output #3
100
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。