# Codeforces #332 A. Laurenty and Shop （枚举）

sa,b;  l(s,a)=d1,l(s,a)=d2,l(a,b)=d3,ss$房子s两个超市a, b;\ \ l(s, a)=d1, l(s, a)=d2, l(a, b)=d3, 求s到两个超市并回到s的最短距离$

4,$一共4种情况, 想清楚$

//
//  Created by TaoSama on 2015-11-21
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int d1, d2, d3;

int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);

while(cin >> d1 >> d2 >> d3) {
int ans = min(d1 + d2 + d3, (d1 + d2) * 2);
ans = min(ans, 2 * (d1 + d3));
ans = min(ans, 2 * (d2 + d3));
cout << ans << '\n';
}
return 0;
}

10-13 519

09-12 1397

01-04 206

03-08 22

03-04 256

10-13 249

05-30 186

03-25 211

12-17 533

10-13 500