a, b, c = [int(i) for i in input().split()]
a, b = min(a,b), max(a,b)
print(a+min(c,a+b)+min(b,a+c))#include <bits/stdc++.h>
using namespace std;
int main()
{
int d[3];
for(int i=0; i<3; i++) cin >> d[i];
sort(d,d+3);
int ans=0;
if((2*d[0]) + (2*d[1])<=(d[0]+d[1]+d[2])){
ans = (2*d[0]) + (2*d[1]);
}
else ans = d[0]+d[1]+d[2];
cout << ans;
return 0;
}
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |