Problem:
 Score : 100 points    Problem Statement Snuke is buying a bicycle.
The bicycle of his choice does not come with a bell, so he has to buy one separately.  He has very high awareness of safety, and decides to buy two bells, one for each hand.  The store sells three kinds of bells for the price of a , b and c yen (the currency of Japan), respectively.
Find the minimum total price of two different bells.      Constraints  1 \leq a,b,c \leq 10000  a , b and c are integers.         Input Input is given from Standard Input in the following format:  a  b  c       Output Print the minimum total price of two different bells.        Sample Input 1 700 600 780      Sample Output 1 1300   Buying a 700 -yen bell and a 600 -yen bell costs 1300 yen.  Buying a 700 -yen bell and a 780 -yen bell costs 1480 yen.  Buying a 600 -yen bell and a 780 -yen bell costs 1380 yen.   The minimum among these is 1300 yen.       Sample Input 2 10000 10000 10000      Sample Output 2 20000  Buying any two bells costs 20000 yen.

Solution (Python):
A = list(map(int, input().split()))
A.sort()
print(sum(A[:2]))

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    price = [A, B, C]
    price.sort()
    print(price[0] + price[1])
main()

Solution (Python):
print(sum(sorted(map(int,input().split()))[:2]))

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c = map(int,input().split())
ans = min(a+b,a+c,b+c)
print(ans)

Solution (Python):
a,b,_=sorted(map(int,input().split()))
print(a+b)

Solution (Python):
apple = sorted(list(map(int, input().split())))
print(apple[0] + apple[1])

Solution (Python):
print(sum(sorted(map(int,input().split()))[:2]))

Solution (Python):
l = list(map(int, input().split()))
print(sum(l) - max(l))

Solution (Python):
bells_price = list(map(int, input().split()))
bells_price.sort()
print(bells_price[0] + bells_price[1])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
a, b, c = map(int, input().split())

list_a = []
list_a.append(a)
list_a.append(b)
list_a.append(c)


list_a.sort()

print(list_a[0] + list_a[1])

Solution (Python):
a = list(sorted(list(map(int,input().split()))))
print(a[0] + a[-2])

Solution (Python):
print(sum(sorted(map(int,input().split()))[:2]))

Solution (Python):
def resolve():
    a = list(map(int, input().split()))
    a.sort()

    ans = a[0] + a[1]

    print(ans)
resolve()

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    a, b, c = map(int, input().split())

    price = [a, b, c]
    price.sort()
    ans = price[0] + price[1]

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a = list(map(int,input().split()))
print(sorted(a)[0] + sorted(a)[1])

Solution (Python):
list = [0, 0, 0]
list[0], list[1], list[2] = map(int, input().split())
list.sort()
print(list[0] + list[1])

Solution (Python):
a,b,c=map(int,input().split())
L=[a,b,c]
L=sorted(L)
print(L[0]+L[1])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
abc=sorted(list(map(int,input().split())))
print(abc[0]+abc[1])

Solution (Python):
a,b,c = map(int, input().split())
max_value = a
if b > max_value:
  max_value = b
if c > max_value:
  max_value = c
  
print(a + b + c - max_value)

Solution (Python):
abc = list(map(int, input().split()))
abc.sort()
print(abc[0] + abc[1])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
a = list(map(int,input().split()))
a = sorted(a)
print(a[0] + a[1])

Solution (Python):
a,b,c=map(int,input().split())
print(min([a+b,b+c,c+a]))

Solution (Python):
a,b,c = list(map(int,input().strip().split()))

print(a+b+c -max(a,b,c))

Solution (Python):
a,b,c=map(int,input().split());print(min(a+b,b+c,c+a))

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
bell=list(map(int,input().split()))
bell.sort()
print(bell[0]+bell[1])

Solution (Python):

A = [int(a) for a in input().split()]
ans = sum(A)-max(A)
print(ans)

Solution (Python):
a, b, c = map(int, input().split())
x = max(a, b, c)

print(a + b + c - x)

Solution (Python):
a,b,c = map(int, input().split())

print(min(a+b,a+c,b+c))

Solution (Python):
a,b,c = map(int, input().split())
print(min(a+b, b+c, a+c))

Solution (Python):
bells = sorted([int(i) for i in input().split()])
print(sum(bells[:2]))

Solution (Python):
x=list(map(int,input().split()))
y=sorted(x)

print(y[0]+y[1])

Solution (Python):
a, b, c = map(int, input().split())

print(min(a+b, a+c, b+c))

Solution (Python):
a,b,c = map(int,input().split())

print(min(a+b,b+c,c+a))

Solution (Python):
a = sorted(map(int, input().split()))
print(sum(a[:2]))

Solution (Python):
a = sorted(list(map(int, input().split())))
print(sum(a[:2]))

Solution (Python):
a,b,c=map(int,input().split())
print(a+b+c-max(a,b,c))

Solution (Python):
A = list(map(int, input().split()))
A = sorted(A)
print(A[0]+A[1])

Solution (Python):
a,b,c = map(int,input().split())

m = min(a + b,a + c,b + c)

print(m)

Solution (Python):
abc = list(map(int, input().split()))
abc.sort()
print(abc[0]+abc[1])

Solution (Python):
price = list(map(int, input().split()))
price.sort()
ans = price[0] + price[1]
print(ans)

Solution (Python):
l=list(map(int,input().split()))
d=min(l)
l.remove(d)
e=min(l)
print(d+e)

Solution (Python):
abc=list(map(int,input().split()))
print(sum(sorted(abc)[:2]))

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
A, B, C = list(map(int, input().split()))
print(min(A+B, B+C, C+A))

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, min(b+c, c+a)))

Solution (Python):
import sys

a,b,c=map(int,sys.stdin.readline().split())
print(a+b+c-max(a,b,c))

Solution (Python):
arr = list(map(int, input().split()))
arr.sort()
print(arr[0]+ arr[1])

Solution (Python):
a,b,c = sorted(map(int,input().split()))
print(a+b)

Solution (Python):
a,b,c=map(int,input().split())
if a<b<c:
	print(a+b)
elif a<c<b:
	print(a+c)
elif b<a<c:
	print(b+a)
elif b<c<a:
	print(b+c)
elif c<a<b:
	print(c+a)
else:
	print(c+b)

Solution (Python):
A, B, C = map(int, input().split())

print(min(A + B, A + C, B + C))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a + b, b + c, c + a))

Solution (Python):
a,b,c=map(int,input().split());print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c=map(int, input().split())
print(a+b+c-max(a,b,c))

Solution (Python):
S = list(map(int, input().split()))
print(sum(sorted(S)[:2]))

Solution (Python):
a,b,c = sorted(map(int,input().split()))
print(a+b)

Solution (Python):
a=list(map(int,input().split()))
b=sorted(a)
print(b[0]+b[1])

Solution (Python):
l=list(map(int,input().split()))

print(sum(sorted(l)[:-1]))

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c  = mi()
    print(a + b + c - max(a, b, c))


if __name__ == "__main__":
    main()

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
bell=list(map(int,input().split()))
bell.sort()
print(bell[0]+bell[1])

Solution (Python):

a,b,c=map(int,input().split())

print(a+b+c-max(a,b,c))

Solution (Python):
a,b,c=map(int,input().split())
print(a+b+c-max(a,b,c))

Solution (Python):
a,b,c= map(int,input().split())

print(min(a+b, b+c, c+a))

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

Solution (Python):
l = sorted(list(map(int,input().split())))
print(sum(l[:2]))

Solution (Python):
*abc, = map(int, input().split())
abc.sort()
print(sum(abc[:2]))

Solution (Python):
l=list(map(int,input().split()))
print(sum(l)-max(l))

Solution (Python):
a=list(map(int,input().split()))
print(sum(a)-max(a))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))

Solution (Python):
x = sorted(list(map(int, input().split())))
print(x[0]+x[1])

Solution (Python):
a,b,c = map(int, input().split())

print(min(a+b,b+c,c+a))

Solution (Python):
a=list(map(int,input().split()))
a.sort()
print(a[0]+a[1])

Solution (Python):
l = list(map(int, input().split()))
print(sum(sorted(l)[:2]))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, a+c, b+c))

Solution (Python):
a, b, c = map(int, input().split())

print(sum([a, b, c]) - max([a, b, c]))

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c = map(int, readline().split())
ans = (a + b + c) - max(a, b, c)
print(ans)

Solution (Python):
abc = sorted(list(map(int, input().split())))

print(sum(abc[:2]))

Solution (Python):
x, y, z = map(int, input().split())
i = x + y + z
print(i-max(x, y, z))

Solution (Python):
P = list(map(int, input().split()))
print(sum(sorted(P)[:2]))

Solution (Python):
a, b, c = map(int, input().split())
print(a + b + c - max([a, b, c]))

Solution (Python):
l=sorted(list(map(int,input().split())))
print(l[0]+l[1])

Solution (Python):
def main():
  num = list(map(int,input().split()))
  if num[0]+num[1]>num[0]+num[2]:
    if num[0]+num[2]>num[1]+num[2]:
      print(num[1]+num[2])
    else:
      print(num[0]+num[2])
  else:
    if num[0]+num[1]>num[1]+num[2]:
      print(num[1]+num[2])
    else:
      print(num[0]+num[1])
    
main()

Solution (Python):
a, b, c = map(int, input().split())
if a >= b and a >= c:
    print(b + c)
elif b >= a and b >= c:
    print(a + c)
else:
    print(a + b)

Solution (Python):
print(sum(sorted(map(int, input().split()))[:2]))

Solution (Python):
a, b, c = map(int, input().split())

ans = min([a + b, b + c, c + a])
print(ans)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    l=list(map(int,input().split()))
    l.sort()
    print(sum(l[:2]))

if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
print(a+b+c-max(a, b, c))

Solution (Python):
a,b,c =map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
a = list(map(int, input().split()))
print(sum(a)-max(a))

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b, c = map(int, input().split())
    print(min(a + b, a + c, b + c))


if __name__ == '__main__':
    resolve()

Solution (Python):
a,b,c=map(int,input().split())
s=[a,b,c]
s.sort()
print(s[0]+s[1])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
a,b,c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
a, b, c = map(int, input().split())
print(a + b + c - max(a, b, c))

Solution (Python):
x = list(map(int, input().split()))
print(sum(x) - max(x))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    l=list(map(int,input().split()))
    print(sum(l)-max(l))
resolve()

Solution (Python):

lst = sorted(list(map(int, input().split())))
print(lst[0] + lst[1])

Solution (Python):

lst = sorted(list(map(int, input().split())))
print(lst[0] + lst[1])

Solution (Python):
a,b,c=map(int,input().split())
print (min((a+b),(a+c),(b+c)))

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,b+c,a+c))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    l=list(map(int,input().split()))
    l.sort()
    print(l[1]+l[0])
resolve()

Solution (Python):
import sys
import math
import bisect

def main():
    A = list(map(int, input().split()))
    A.sort()
    print(sum(A[0:2]))

if __name__ == "__main__":
    main()

Solution (Python):
a, b, c = map(int, input().split())
print(sum([a, b, c]) - max(a, b, c))

Solution (Python):

"""
Created on Wed May 13 13:28:22 2020

@author: shinba
"""

A = list(map(int,input().split()))
A.sort()
print(A[0]+A[1])

Solution (Python):
print(sum(sorted(map(int, input().split()))[:2]))

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





a,b,c = inputIL()

print(a+b+c-max(a,b,c))

Solution (Python):
a, b, c = sorted(map(int, input().split()))
ans = a + b
print(ans)

Solution (Python):
a, b, c = map(int, input().split())

ans = a + b + c - max(a, b, c)
print(ans)

Solution (Python):
a,b,c = map(int,input().split())	

li = [a+b,a+c,b+c]
print(min(li))

Solution (Python):
print(sum(sorted(list(map(int, input().split())))[:2]))

Solution (Python):
from itertools import combinations as comb


def main():
    abc = list(map(int, input().split()))
    abc_pairs = comb(abc, 2)
    ans = float("inf")

    for abc_pair in abc_pairs:
        ans = min(ans, sum(abc_pair))

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a,b,c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
a,b,c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
l=list(map(int,input().split()))
l.sort()

print(l[0]+l[1])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
l = list(map(int,input().split()))
l.sort()
print(l[0]+l[1])

Solution (Python):
bell = list(map(int, input().split()))
bell.sort()
print(bell[0]+bell[1])

Solution (Python):
Bells = list(map(int,input().split()))
print(sum(Bells)-max(Bells))

Solution (Python):
a,b,c=map(int,input().split())
ans=min(a+b,a+c,c+b)
print(ans)

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, a+c, b+c))

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

print(sum(sorted(ri_())[:2]))

Solution (Python):
l=list(map(int,input().split()))
l.sort(key=int)
print(l[0]+l[1])

Solution (Python):
a = list(map(int,input().split()))
print(sum(a)-max(a))

Solution (Python):
a, b, c = map(int, input().split())
cost1 = a + b
cost2 = a + c
cost3 = b + c
print(min(cost1, cost2, cost3))

Solution (Python):
a,b,c = map(int,input().split())
ans = a+b+c
ans = ans - max(a,b,c)
print(ans)

Solution (Python):
def ABC_66_A():
    a,b,c = map(int, input().split())
    
    if (a+b <= b+c) and (a+b <= a+c):
        print(a+b)
    elif (b+c <= a+b) and (b+c <= a+c):
        print(b+c)
    else:
        print(a+c)

if __name__ == '__main__':

    ABC_66_A()

Solution (Python):
lst=list(map(int,input().split()))
lst.sort()
print(lst[0]+lst[1])

Solution (Python):
a, b, c = list(map(int,input().split()))
print(min(a+b,b+c,c+a))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))

Solution (Python):
A = [int(i) for i in input().split()]
print(sum(A) - max(A))

Solution (Python):
def main():
    a,b,c = (int(x) for x in input().split())
    print(min(a+b,a+c,b+c))

if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = list(map(int,input().split()))
print(a+b+c-max(a, b, c))

Solution (Python):
a, b, c = map(int, input().split())

ans = max(a, b, c)

if ans == a:
    print(b+c)
elif ans == b:
    print(a+c)
elif ans == c:
    print(a+b)

Solution (Python):
a,b,c = sorted(map(int,input().split()))

print(a+b)

Solution (Python):

a, b, c = sorted(map(int, input().split()))

print(a+b)

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))

Solution (Python):
a, b, c = list(map(int, input().split()))

price = []
price.append(a + b)
price.append(a + c)
price.append(b + c)
print(min(price))

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

Solution (Python):
a, b, c = map(int, input().split())
print(a + b + c - max(a, b, c))

Solution (Python):
print(sum(sorted(map(int,input().split()))[0:2]))

Solution (Python):
a, b, c = map(int, input().split())

print(min(a + b, a + c, b + c))

Solution (Python):
*p, = map(int, input().split())
print(min(p[0]+p[1], p[1]+p[2], p[2]+p[0]))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
a, b, c = MAP()
print(a+b+c-max(a,b,c))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
print(sum(A)-max(A))

Solution (Python):

import collections
import itertools as it
import math

 


a, b, c  = map(int, input().split())





li = sorted([a, b, c])
print(sum(li[:2]))

Solution (Python):


a, b, c = map(int, input().split())

ans = min(a+b, min(a+c, b+c))
print(ans)

Solution (Python):
a,b,c=map(int,input().split())
ans=min(a+b,a+c)
ans=min(ans,b+c)
print(ans)

Solution (Python):
a, b, c = list(map(int, input().split()))

print(min(a + b, a + c, b + c))

Solution (Python):
l = list(map(int, input().split()))
l.sort()
print(l[0]+l[1])

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, a+c))

Solution (Python):
array = sorted(list(map(int, input().split())))
print(array[0]+array[1])

Solution (Python):
a, b, c = map(int, input().split())
print(sum(sorted([a, b, c])[:2]))

Solution (Python):


a, b, c = map(int, input().split())

print(a+b+c-max(a,b,c))

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

a,b,c = map(int,input().split())
ab = a + b
ac = a + c
bc = b + c
ans = min(ab,ac)
ans = min(ans,bc)
print(ans)

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print(a+b)

Solution (Python):
a,b,c=map(int,input().split())
print(a+b+c-max(a,b,c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, a+c))

Solution (Python):
a, b, _ = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
a, b, c = map(int, input().split())

print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c=map(int,input().split())
ans=a+b+c-max(a,b,c)
print(ans)

Solution (Python):
print(sum(sorted([int(x) for x in input().split()])[:2]))

Solution (Python):
a = sorted(list(map(int, input().split())))
print(a[0] + a[1])

Solution (Python):
l=list(map(int,input().split()))
print(sum(l)-max(l))

Solution (Python):
a,b,c=map(int,input().split())
n=[a+b,a+c,b+c]
n.sort()
print(n[0])

Solution (Python):
a,b,c = map(int,input().split())

print(min(a+b,a+c,b+c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))

Solution (Python):
B = list(map(int, input().split()))
print(sum(B) - max(B))

Solution (Python):
a,b,c=map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c=map(int,input().split())
print(min([a+b,a+c,b+c]))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a + b, a + c, b + c))

Solution (Python):
s = list(map(int, input().split()))
s.sort()
print(s[0]+s[1])

Solution (Python):
a,b,c=map(int,input().split())
print(min([a+b,b+c,c+a]))

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

x,a,b=MI()
ans=min(min(a+b,a+x),b+x)
print(ans)

Solution (Python):
def resolve():
	n = list(map(int, input().split()))
	m = max(n)
	print(sum(n) - max(n))
resolve()

Solution (Python):
x = sorted(list(map(int, input().split())))
print(x[0]+x[1])

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print(a+b)

Solution (Python):
a,b,c = map(int,input().split())
A = a+b
B = a+c
C = b+c
if A <= B and A <= C:
  print(A)
elif B <= A and B <= C:
  print(B)
else:
  print(C)

Solution (Python):
abc = list(map(int, input().split()))
print(sum(abc) - max(abc))

Solution (Python):
a=sorted(map(int,input().split()))
print(a[0]+a[1])

Solution (Python):
a,b,c=map(int,input().split())
L=[a,b,c]
L.sort()
print(L[1]+L[0])

Solution (Python):
a,b,c=map(int,input().split())
d=[a+b,b+c,a+c]
print(min(d))

Solution (Python):
l=sorted(list(map(int,input().split())))
print(sum(l[:2]))

Solution (Python):
a, b, c = map(int, input().split())
print(a + b + c - max(a, b, c))

Solution (Python):

def resolve():
    a, b, c = list(map(int, input().split()))
    print(min(a+b, b+c, c+a))


if '__main__' == __name__:
    resolve()

Solution (Python):
x, a, b = map(int, input().split())

A = x + a
B = x + b
C = a + b

if A <= B and A <= C:
    print(A)
elif B <= C and B <= A:
    print(B)
else:
    print(C)

Solution (Python):
a,b,c = map(int,input().split())
print(a+b+c-max(a,b,c))

Solution (Python):
l = list(map(int, input().split()))
s = min(l)
l.remove(s)
t = min(l)
print(s+t)

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))

Solution (Python):
a,b,c=[int(i) for i in input().split()]
list=[a,b,c]
list.sort()
print(list[0]+list[1])

Solution (Python):
list = list(map(int, input().split()))*2
print(min(list[0]+list[1], list[1]+list[2], list[2]+list[0]))

Solution (Python):
li = list(map(int,input().split()))
li.sort()
print(sum(li[:2]))

Solution (Python):
a,b,c = map(int, input().split())
print(min(a+b, b+c, c+a))

Solution (Python):
A,B,C=map(int,input().split())
if A<B:
  if B<C: print(A+B)
  else: print(A+C)
else:
  if A<C: print(A+B)
  else: print(B+C)

Solution (Python):

a, b, c = map(int, input().split())
print(a + b + c - max(a, b, c))

Solution (Python):
abc = sorted(list(map(int, input().split())))
print(abc[0]+abc[1])

Solution (Python):
a, b, c = map(int, input().split())
min = a+b
if min > b+c:
    min = b+c

if min > a+c:
    min = a+c

print(min)

Solution (Python):
L = list(map(int,input().split()))
L.sort()
print(sum(L[:2]))

Solution (Python):
a,b,c = map(int,input().split())

a,b,c= sorted([a,b,c])

print(a+b)

Solution (Python):
a,b,c=map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c=map(int,input().split())

A=a+b
B=b+c
C=c+a

print(min(A,B,C))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, b+c, a+c))

Solution (Python):
a, b, c = map(int, input().split())

print(min(a+b, b+c, c+a))

Solution (Python):
a,b,c=map(int,input().split())
print(min(a+b,a+c,b+c))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a, b, c) + a + b + c - min(a, b, c) - max(a, b, c))

Solution (Python):
a,b,c=map(int, input().split())
print(sum([a,b,c])-max([a,b,c]))

Solution (Python):
a,b,c=map(int,input().split())
print(a+b+c-max(a,b,c))

Solution (Python):
s=list(map(int,input().split()))
new=sorted(s)

tot=new[0]+new[1]
print(tot)

Solution (Python):
x = list(map(int, input().split()))
x.sort()
print(x[0]+x[1])

Solution (Python):
a, b, c = map( int, input().split() )

x = max(a,b,c)
if a == x:
  print(b+c)
elif b == x:
  print(a+c)
else:
  print(a+b)

Solution (Python):
a,b,c = sorted(map(int,input().split()))

print(a+b)

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print(a+b)

Solution (Python):
a,b,c = list(map(int,input().split()))
print((a+b+c)-max(a,b,c))

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c = map(int,input().split())
print(min(a+b,b+c,c+a))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b, a+c, b+c))

Solution (Python):
abc = list(map(int, input().split()))
print(sum(abc) - max(abc))

Solution (Python):
def main():
    t = list(map(int, input().split()))
    t.sort()
    print(t[0] + t[1])

if __name__ == '__main__':
    main()

Solution (Python):
a=list(map(int,input().split()))
a=sorted(a)
print(a[0]+a[1])

Solution (Python):
ring = list(map(int, input().split()))

ring.sort()

print(sum(ring[:2]))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a+b,b+c,a+c))

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    B = sorted(il())
    print(sum(B[:2]))


if __name__ == '__main__':
    main()

Solution (Python):
a,b,c = map(int,input().split())

print(a+b+c-max(a,b,c))

Solution (Python):
icase=0    
if icase==0:
    a,b,c=map(int,input().split())
    print(min(a+b,b+c,c+a))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a + b, b + c, c + a))

Solution (Python):
a, b, c = map(int, input().split())

print(a + b + c - max(a, b, c))

Solution (Python):
l=sorted(map(int,input().split()))
print(l[0]+l[1])

Solution (Python):
a,b,c=map(int,input().split())
print(min(a+b,b+c,a+c))

Solution (Python):
a,b,c = map(int,input().split())

print(min(a+b,b+c,c+a))

Solution (Python):
a,b,c=map(int,input().split())
print(min(a+b,a+c,b+c))

Solution (Python):
l = list(map(int, input().split()))
print(sum(l) - max(l))

Solution (Python):
a,b,c = sorted(map(int,input().split()))

print(a+b)

Solution (Python):
a,b,c=map(int,input().split())
print(min(a+b,b+c,a+c))

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    p_list = sorted([a, b, c])
    print(p_list[0] + p_list[1])
main()

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
a, b, c = map(int, input().split())
print(a + b + c - max(a,b,c))

Solution (Python):
a, b, c = map(int, input().split())

l = [a, b, c]
l.sort()

print(l[0] + l[1])

Solution (Python):
a = list(map(int,input().split()))
a.sort()
print(a[0]+a[1])

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print(a+b)

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a + b)

Solution (Python):
a, b, c =  map(int, input().split())
ans = min(a+b, b+c, c+a)
print(ans)

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
a, b, c = map(int, input().split())

print(a + b + c - max(a, b, c))

Solution (Python):
l=list(map(int,input().split()))
l.sort()
print(l[0]+l[1])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(a+b)

Solution (Python):
a, b, c = map(int, input().split())
print( a+b+c - max(a,b,c) )

Solution (Python):
a,b,c=sorted(list(map(int,input().split())))
print(a+b)

Solution (Python):
n, m, k = map(int, input().split())
print(sum((n,m,k)) - max(n, m, k))

Solution (Python):
abc = sorted(list(map(int, input().split())))

print(abc[0]+abc[1])

Solution (Python):
n = list(map(int,input().split()))
n.sort()
print(n[0]+n[1])

Solution (Python):
print(sum(sorted(map(int, input().split()))[:2]))

Solution (Python):
a = list(map(int, input().split()))
a.remove(max(a))
print(sum(a))

Solution (Python):
a, b, c = map(int, input().split())
print(min([a+b, a+c, b+c]))

Solution (Python):
b = list(map(int, input().split()))

b.sort()
print(b[0]+b[1])