CodeForces 599A Patrick and Shopping

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;

long long d1,d2,d3;

int main()
{
    scanf("%lld%lld%lld",&d1,&d2,&d3);
    long long X,Y,Z;
    X=min(d1,d2+d3);
    Y=min(d2,d1+d3);
    Z=min(d3,d1+d2);
    long long ans=min(2*X+2*Y,X+Y+Z);
    printf("%lld\n",ans);
    return 0;
}