AtCoder Beginner Contest 066
翻译中…
Problem Statement
翻译中…
Snuke is buying a bicycle. The bicycle of his choice does not come with a bell, so he has to buy one separately.
翻译中…
He has very high awareness of safety, and decides to buy two bells, one for each hand.
翻译中…
The store sells three kinds of bells for the price of $a$, $b$ and $c$ yen (the currency of Japan), respectively. Find the minimum total price of two different bells.
翻译中…
Constraints
翻译中…
$1 \leq a,b,c \leq 10000$$a$,$b$and$c$are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
a b c翻译中…
Output
翻译中…
Print the minimum total price of two different bells.
翻译中…
样例
Input #1
700 600 780
Output #1
1300
- Buying a $700$-yen bell and a $600$-yen bell costs $1300$ yen.
- Buying a $700$-yen bell and a $780$-yen bell costs $1480$ yen.
- Buying a $600$-yen bell and a $780$-yen bell costs $1380$ yen.
The minimum among these is $1300$ yen.
Input #2
10000 10000 10000
Output #2
20000
Buying any two bells costs $20000$ yen.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。