【Codeforces 599A】Patrick and Shopping 最短路程

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 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.

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

60

Input

1 1 5

Output

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.

        这道题就是算最短距离，从家出发经过两个商店后，回到家。WA的原因如下：因为他肯定要先去到一个商店，之后有两个选择，去另一个商店和回家再去另一个商店，由于最后都是从商店回家，所以比较那两段距离，哪段近选哪段。这种想法错就错在认为他最终是从商店回到家中，因为还有一种可能就是原路返回比从那家商店到家的距离更近。代码如下：

#include<stdio.h>
int main(){
	int d1, d2, d3, ans;
	while(scanf("%d%d%d", &d1, &d2, &d3) != EOF){
		int min, max;
		min = d1 < d2 ? d1 : d2;
		max = d1+d2-min;
		if(d1+d2 <= d3)	ans = 2*(d1+d2);
		else{
			if(max < min+d3)	ans = d3 + d1 + d2;
			else ans = 2*(min+d3);
		}
		printf("%d\n", ans);
	}
	return 0;
}