Codeforces 599A. Patrick and Shopping

Click here to view the problem
/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int main()
{
    int d1, d2, d3,i,p ;
    vector<int> data ;
    for(i=0 ; i<3 ; i++)
    {
        cin>>p ;
        data.pb(p) ;
    }
    sort(data.begin(),data.end()) ;
    d1 = data[0] ;
    d2 = data[1] ;
    d3 = data[2] ;
    int dis1 = (d1*2) + (d2*2) ;
    int dis2 = d1 + d2 + d3 ;
    p = min(dis1,dis2) ;
    pf("%d",p) ;

    return 0;
}