Codeforces 599A - Patrick and Shopping
Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long road between his house and the first shop and a d2 meter long road between his house and the second shop. Also, there is a road of length d3 directly connecting these two shops to each other. Help Patrick calculate the minimum distance that he needs to walk in order to go to both shops and return to his house.
Patrick always starts at his house. He should visit both shops moving only along the three existing roads and return back to his house. He doesn’t mind visiting the same shop or passing the same road multiple times. The only goal is to minimize the total distance traveled.
Input:
The first line of the input contains three integers d1, d2, d3 (1 ≤ d1, d2, d3 ≤ 108) — the lengths of the paths.
● d1 is the length of the path connecting Patrick’s house and the first shop.
● d2 is the length of the path connecting Patrick’s house and the second shop.
● d3 is the length of the path connecting both shops.
Output:
Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.
範例:
input:
1 | 10 20 30 |
output:
1 | 60 |
input:
1 | 1 1 5 |
output:
1 | 4 |
Note:
The first sample is shown on the picture in the problem statement. One of the optimal routes is: house -> first -> shop -> second -> shop house.
In the second sample one of the optimal routes is: house -> first -> shop -> house -> second -> shop -> house.
題意:
輸入家到商店1、家到商店2和商店1到商店2的距離，問你從家開始，去過兩間商店，在回到家中的最短距離是多少？可以重複經過同一條路或同一個點。
思路:
比較繞一圈或不走其中一條路的走法哪個最短即可。