2017寒假集训-小题训练1：C - Patrick and Shopping_day patrick waits for a visit from his friend spon-CSDN博客

本文链接：https://blog.csdn.net/Lazarus_Ye/article/details/54576673

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

Example

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.

AC代码：http://paste.ubuntu.com/23809844/

一次就AC，岂不美哉~

题解：这道题的大意，就是输入三个整数分别为家到商店A的距离，家到商店B的距离，两个商店之间的距离

我们的要求是最后所走的路程最小，可以走重复的路。

那么因为只有三个地点，我们完全可以写出全部的情况：

1：家->A->家->B->家

2：家->A->B->家

3：家->A->B->A->家

4：家->B->A->B->家

然后只要取四种情况中所走的路最短的那种即可。