output_description: Print the minimum total price of two different bells.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      a b c
attempt: print(sum(sorted(list(map(int,input().split()))[:2]))
problem_description: 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.
samples: [{"input": "700 600 780", "output": "1300\n    \n\n  * Buying a 700-yen bell and a 600-yen bell costs 1300 yen.\n  * Buying a 700-yen bell and a 780-yen bell costs 1480 yen.\n  * Buying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\n* * *"}, {"input": "10000 10000 10000", "output": "20000\n    \n\nBuying any two bells costs 20000 yen."}]