Codeforces 599A Patrick and Shopping Solution

Solve in C++:

///AH Tonmoy
///Department of CSE
///Islamic University,Bangladesh
#include<bits/stdc++.h>
using namespace std;
int main()
{
  int d1,d2,d3,r1,r2,r3,r,ans;
  while(cin>>d1>>d2>>d3)
  {
      r=d1+d2+d3;
      r1=min(r,(d1+d2)*2);
      r2=min(r,(d2+d3)*2);
      r3=min(r,(d1+d3)*2);

      ans=min(min(r2,r3),min(r1,r2));

        cout<<ans<<endl;
      ans=0;
  }
}