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

题意：给你三个距离，a,b,c,求经过两家shop的最短路。

解：求min(a+b+c,min(2*b+2*a,min(2*a+2*c,2*b+2*c)));

#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;
}