Problem2107--ABC129A - Airplane

2107: ABC129A - Airplane

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

SubmitSolved: 35Submit Num: 84Statistics

Description

Problem Statement

There are three airports A, B and C, and flights between each pair of airports in both directions.
A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.
Consider a route where we start at one of the airports, fly to another airport and then fly to the other airport.
What is the minimum possible sum of the flight times?

Constraints

  • 1≤P,Q,R≤100
  • All values in input are integers.

Input

Input is given from Standard Input in the following format: 

P Q R

Output

Output

Print the minimum possible sum of the flight times.

Sample Input Copy 

1 3 4

Sample Output Copy 

4

HINT

  • The sum of the flight times in the route A →→ B →→ C: 1+3=4 hours
  • The sum of the flight times in the route A →→ C →→ C: 4+3=7 hours
  • The sum of the flight times in the route B →→ A →→ C: 1+4=5 hours
  • The sum of the flight times in the route B →→ C →→ A: 3+4=7 hours
  • The sum of the flight times in the route C →→ A →→ B: 4+1=5 hours
  • The sum of the flight times in the route C →→ B →→ A: 3+1=4 hours

The minimum of these is 4 hours.

Source/Category

AtCoder 入门  if  基础  强  
Submit