# Patrick and Shopping（模拟）

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

Sample test(s)
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.

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef __int64 ll;
#define T 200005
#define mod 1000000007
int main()
{
#ifdef zsc
freopen("input.txt","r",stdin);
#endif
int s1,s2,s3;
while(~scanf("%d%d%d",&s1,&s2,&s3))
{
int t1=2*(s1+s2),t2=(s1+s2+s3);
t1 = min(t1,t2);
int t3=2*(s2+s3),t4=2*(s1+s3);
t3=min(t3,t4);
printf("%d\n",min(t1,t3));
}
return 0;
}

• 本文已收录于以下专栏：

## 【Codeforces Round 332 (Div 2)A】【水题】A. Patrick and Shopping 遍历三元环的最小成本

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes...

## Patrick and Shopping

Description Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, ...

## Codeforces Round #332 (Div. 2) A. Patrick and Shopping

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes...

## hpu暑假训练C - Patrick and Shopping 【思维】&&【水题】

Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs t...

## Field and Galois Theory (Patrick Morandi)

• 2010年11月11日 23:38
• 6.96MB
• 下载

## NOIP模拟 shopping【线段树 or Splay】

• cdsszjj
• 2017年11月07日 19:54
• 55

## Patrick’s blog is online now!

Patrick’s blog is online now!

## Patrick Wyatt：代码没问题 程序却有bug？

举报原因： 您举报文章：Patrick and Shopping（模拟） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)