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):
tmp = [int(i) for i in input().split(' ')]
a = tmp[0]
b = tmp[1]
c = tmp[2]
print(min(a+b, b+c, c+a))

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

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

Solution (Python):

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

Solution (Python):
import math
bell = [int(i) for i in input().split()]
print(bell[0]+bell[1]+bell[2]-max(bell))

Solution (Python):
import math
inf=float('inf')
x = list(map(int, input().split()))
y=[x[0]+x[1],x[1]+x[2],x[2]+x[0]]
print(min(y[:]))

quit()

Solution (Python):
nums = [int(x) for x in input().split()]
nums.sort()

ans = nums[0] + nums[1]
print(ans)

Solution (Python):
cost = list(map(int, input().split()))
cost = sorted(cost)
print(sum(cost[:-1]))

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

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

Solution (Python):
import math


def f():
    a  = (list(map(int, input().split(" "))))
    a.sort()
    print(a[1]+min(a))

f()

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

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

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

Solution (Python):


a = map(int, raw_input().split())
a = sorted(a)
print(a[0]+a[1])

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

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

Solution (Python):
x = [int(i) for i in input().split(" ")]
x.sort()
print(x[0] + x[1])

Solution (Python):
a = map(int, raw_input().split())

a.sort()

print a[0] + a[1]

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

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

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

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

Solution (Python):
src = map(int, raw_input().split())
print sum(src) - max(src)

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

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

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

Solution (Python):



from __future__ import division, print_function
import sys


def main():
    l = map(int, sys.stdin.readline().strip().split(" "))
    l.sort()
    print(l[0] + l[1])


if __name__ == '__main__':
    main()

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

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

print(ans)

Solution (Python):

def get_ln_inputs():
    return input().split()


def get_ln_int_inputs():
    return list(map(int, get_ln_inputs()))


def main():
    p = get_ln_int_inputs()
    print(sum(p) - max(p))


main()