CF-332-div2-A. Patrick and Shopping-CSDN博客

本文链接：https://blog.csdn.net/Inite/article/details/49961911

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 ad₁ meter long road between his house and the first shop and ad₂ meter long road between his house and the second shop. Also, there is a road of lengthd₃ 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.

$\text{[math]}$

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 d₁,d₂,d₃ (1 ≤ d₁, d₂, d₃ ≤ 10⁸) — the lengths of the paths.

d₁ is the length of the path connecting Patrick's house and the first shop;
d₂ is the length of the path connecting Patrick's house and the second shop;
d₃ 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.

Sample test(s)

Input

10 20 30

Output

Input

1 1 5

Output

Note

The first sample is shown on the picture in the problem statement. One of the optimal routes is: house $\text{[math]}$ first shop $\text{[math]}$ second shop $\text{[math]}$ house.

In the second sample one of the optimal routes is: house $\text{[math]}$ first shop $\text{[math]}$ house $\text{[math]}$ second shop $\text{[math]}$ house.

题意：某个家与2个相邻超市距离分别为d1和d2，2个超市距离为d3，求从家出发经2个超市后返回所需的最短路径长度，可以任意经过某个点多次，无限制。

思路：共2种走法：1：分别直接到2个超市(不经过d3)，再原路返回；2：经过d3有2种情况：a:直接走成一个圈回到原地；b:经过到2个超市直接路径短的加上d3，再原路返回。
最后取最小值。

code: