100 atcoder#ABC066A. [ABC066A] ringring

[ABC066A] ringring

Score : 100100 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 aa, bb and cc yen (the currency of Japan), respectively. Find the minimum total price of two different bells.

Constraints

  • 1a,b,c100001 \leq a,b,c \leq 10000
  • aa, bb and cc are integers.

Input

Input is given from Standard Input in the following format:

aa bb cc

Output

Print the minimum total price of two different bells.

700 600 780
1300
  • Buying a 700700-yen bell and a 600600-yen bell costs 13001300 yen.
  • Buying a 700700-yen bell and a 780780-yen bell costs 14801480 yen.
  • Buying a 600600-yen bell and a 780780-yen bell costs 13801380 yen.

The minimum among these is 13001300 yen.

10000 10000 10000
20000

Buying any two bells costs 2000020000 yen.