AtCoder Grand Contest 019
翻译中…
Problem Statement
翻译中…
You've come to your favorite store Infinitesco to buy some ice tea.
翻译中…
The store sells ice tea in bottles of different volumes at different costs. Specifically, a $0.25$-liter bottle costs $Q$ yen, a $0.5$-liter bottle costs $H$ yen, a $1$-liter bottle costs $S$ yen, and a $2$-liter bottle costs $D$ yen. The store has an infinite supply of bottles of each type.
翻译中…
You want to buy exactly $N$ liters of ice tea. How many yen do you have to spend?
翻译中…
Constraints
翻译中…
$1 \leq Q, H, S, D \leq 10^8$$1 \leq N \leq 10^9$- All input values are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
Q H S D
N
翻译中…
Output
翻译中…
Print the smallest number of yen you have to spend to buy exactly $N$ liters of ice tea.
翻译中…
样例
Input #1
20 30 70 90
3
Output #1
150
Buy one $2$-liter bottle and two $0.5$-liter bottles. You'll get $3$ liters for $90 + 30 + 30 = 150$ yen.
Input #2
10000 1000 100 10
1
Output #2
100
Even though a $2$-liter bottle costs just $10$ yen, you need only $1$ liter. Thus, you have to buy a $1$-liter bottle for $100$ yen.
Input #3
10 100 1000 10000
1
Output #3
40
Now it's better to buy four $0.25$-liter bottles for $10 + 10 + 10 + 10 = 40$ yen.
Input #4
12345678 87654321 12345678 87654321
123456789
Output #4
1524157763907942
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。