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

#include<stdio.h>
#include<algorithm>
using namespace std;
#define LL long long
int main()
{
LL a,b,c;
while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
{
LL x1=2*a+2*b;
LL x2=2*a+2*c;
LL x3=2*b+2*c;
LL x4=a+b+c;
LL y=min(x1,min(x2,min(x3,x4)));
printf("%lld\n",y);
}
return 0;
}

#### Codeforces Round #471 div.2 ABC题解

2018-03-24 14:16:58

#### 【CodeForces】CodeForces Round #464 (Div. 2) 题解

2018-02-18 11:05:43

#### Codeforces Round #444 (Div. 2)-贪心&尺取-Ratings and Reality Shows

2017-11-11 20:11:11

#### Codeforces Round #366 (Div. 2)题解报告

2016-08-08 11:26:50

#### Codeforces Round #487 (Div. 2) ---A.A Blend of Springtime

2018-06-12 11:21:23

#### Codeforces Round #394 (Div. 2) A. Dasha and Stairs 易错

2017-03-17 23:38:43

#### Codeforces Round #387(Div. 2)A. Display Size【暴力】

2016-12-19 14:32:55

#### Educational Codeforces Round 36 (Rated for Div. 2) 题解

2018-01-13 23:16:24

#### Codeforces Round #471 (Div. 2)

2018-03-27 23:23:41

#### Codeforces Round #479 (Div. 3) F - Consecutive Subsequence（思维）

2018-05-07 11:08:38