100 atcoder#ABC066A. [ABC066A] ringring
[ABC066A] ringring
Score : points
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 , and yen (the currency of Japan), respectively. Find the minimum total price of two different bells.
Constraints
- , and are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the minimum total price of two different bells.
700 600 780
1300
- Buying a -yen bell and a -yen bell costs yen.
- Buying a -yen bell and a -yen bell costs yen.
- Buying a -yen bell and a -yen bell costs yen.
The minimum among these is yen.
10000 10000 10000
20000
Buying any two bells costs yen.