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.



Sample input:
700 600 780


Sample output:
1300

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ab=a+b
ac=a+c
bc=b+c

if ab < ac and ab < bc:
    print(ab)
elif ac < ab and ac < bc:
    print(ac)
elif bc < ab and bc < ac:
    print(bc)
else:
    print(ab)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(A + B + C - max(A, B, C))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a = [int(x) for x in input().split()]
a.sort()
print(a[0] + a[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
A.sort()

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

Submission status: Accepted

Solution code:
a, b, c  = map(lambda x: int(x),  input().split())
 
lis = [a, b, c]
lis.sort()

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

Submission status: Accepted

Solution code:
l=sorted([int(i) for i in input().split()])
print(sum(l[0:2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = [int(p) for p in input().split()]
x.sort()

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

Submission status: Accepted

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

x = sorted([a, b, c])
print(x[0] + x[1])

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    a = [x for x in map(int,input().split())]
    a.sort()
    print(a[0]+a[1])
    return

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = sorted([int(i) for i in input().split()])
print(l[0] + l[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
sum = a[0]+a[1]+a[2]-max(a)
print(sum)

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
x = max(abc)
abc.remove(x)
print(sum(abc))

Submission status: Accepted

Solution code:
import sys

*p, = map(int, sys.stdin.readline().split())

def main():
    p.sort()
    return sum(p[:2])

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

Solution code:
a, b, c = [int(x) for x in input().split()]
print(min(a+b, b+c, c+a))

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, b, c = map(int, sys.stdin.readline().split())

m = max([a,b,c])

print(a + b + c - m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = list(map(int, input().split()))

L = sorted(L)
ans = sum(L[:2])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = sorted([int(i) for i in input().split()])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    bell=LI()
    print(sum(bell)-max(bell))
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
sortedPrice = sorted([a, b, c])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=(int(x) for x in input().split())

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

Submission status: Accepted

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

if a == b and b == c:
    print(a + b)
else:
    list_price = [a, b, c]
    print(sorted(list_price)[0] + sorted(list_price)[1])

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
res = sum(A) - max(A)
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
si = sorted(i)

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

Submission status: Accepted

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

print(total)

Submission status: Accepted

Solution code:
# ABC066a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

bell = tuple(map(int, input().split()))
print(sum(bell)-max(bell))

Submission status: Accepted

Solution code:
##### 解けた #####

a,b,c=list(map(int,input().split(" ")))
sumabc=(a+b+c)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import accumulate

li = list(map(int,stdin.readline().rstrip().split()))

li.sort()

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

Submission status: Accepted

Solution code:
import itertools
bells = list(map(int,input().split()))
ans = []
for a,b in itertools.combinations(bells,2):
  ans.append(a+b)
print(min(ans))

Submission status: Accepted

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

sum1 = a + b
sum2 = a + c
sum3 = b + c

print(min(sum1, sum2, sum3))

Submission status: Accepted

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

a_b = a+b
a_c = a+c
b_c = b+c

print(min(a_b,a_c,b_c))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

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

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

list.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
x = a+b
y = b+c
z = c+a
if x < y and x < z:
    print(x)
elif y < z and y < x:
    print(y)
else:
    print(z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    abc = LI()
    ans = sum(abc) - max(abc)
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

Submission status: Accepted

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

l.sort()

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

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split()) 
box = [a,b,c]
print(min(box)+sorted(box)[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ringring
a, b, c = map(int, input().split())
S = a + b + c
S = S - max(a,b,c)
print(S)

Submission status: Accepted

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

Submission status: Accepted

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

max_n = max(a,b,c)

print(a+b+c-max_n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ls = list(map(int, input().split()))
ls.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

price = [int(p) for p in input().split()]
price.sort()
print(price[0] + price[1])

Submission status: Accepted

Solution code:
# A - ringring
a, b, c = [int(s) for s in input().split()]
total_prices = [a + b, b + c, c + a]
print(min(total_prices))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
s = [a, b, c]
m = max(s)
s.remove(m)
print(sum(s))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
d = list(map(int, input().split()))
d.sort()
print(d[0] + d[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = list(map(int, input().split()))

p.sort()
print(sum(p[:2]))

Submission status: Accepted

Solution code:
data = input().split(" ")
m = 0
s = 0
for i in range(3):
	a = int(data[i])
	s += a
	if a >= m:
		m = a
print(s-m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x in input().split())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

a=  list(map(int,input().split()))

a.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = sorted(map(int,input().split()))
print(sum(c)-max(c))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC066 A - ringring
a,b,c = map(int,input().split())
print(min(a+b,b+c,c+a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

print(sum(a) - max(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

ans = 0
if a < b:
  ans = a
  if b < c:
    ans += b
  else:
    ans += c
else:
  ans = b
  if a < c:
    ans += a
  else:
    ans += c

print(ans)

Submission status: Accepted

Solution code:
# A - ringring
A = list(map(int,input().split()))
A.sort()
print(A[0]+A[1])

Submission status: Accepted

Solution code:
A=[int(i) for i in input().split()]
A.sort()
print(A[0]+A[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INPUT = list(map(int,input().split()))
a=INPUT[0]
b=INPUT[1]
c=INPUT[2]
print(min(a+b,b+c,c+a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
prices = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
price = list(map(int, input().split(" ")))
print(sum(price) - max(price))

Submission status: Accepted

Solution code:
l=[int(j) for j in input().split()]
print(sum(l)-max(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))

a=sorted(a)

print(sum(a[:2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
sum_ab = a + b
sum_bc = b + c
sum_ac = a + c
print(min(sum_ab, min(sum_bc, sum_ac)))

Submission status: Accepted

Solution code:
def main():
    a,b,c=map(int,input().split(' '))
    print(min(a+b,b+c,c+a))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a = list(map(int, input().rstrip('\n').split()))
    a.sort()
    print(sum(a[:2]))


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
a,b,c=map(int,input().split())
ans=min(a+b,b+c,c+a)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    print(sum(sorted(map(int, input().split()))[:-1]))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

li=[a+b,a+c,b+c]

ans=sorted(li)

print(ans[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
bell = list(map(int, input().split()))
ans = bell[0] + bell[1] + bell[2] - max(bell)
print(ans)

Submission status: Accepted

Solution code:
bell = list(map(int, input().split()))

print(sum(bell) - max(bell))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
### 2019/09/26
s = map(int, input().split())
s = sorted(s)
print(s[0] + s[1])

Submission status: Accepted

Solution code:
#A問題
a = list(map(int,input().split()))
a.sort()
print(a[0]+a[1])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ab = a + b
bc = b + c
ac = a + c
if ab < ac and ab < bc:
  print(ab)
elif bc < ab and bc < ac:
  print(bc)
else:
  print(ac)

Submission status: Accepted

Solution code:
import numpy as np
bell_li = list(map(int, input().split()))
bell_np = np.array(bell_li)
bell_np_sorted = bell_np.argsort()
print(bell_li[bell_np_sorted[0]] + bell_li[bell_np_sorted[1]])

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a = LIST()
    a.sort()
    print(a[0]+a[1])
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
sum_ab = a + b
sum_bc = b + c
sum_ac = a + c
print(min(sum_ab, min(sum_ac, sum_bc)))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
item_l =list(map(int,input().split()))
item_l = sorted(item_l)
sum = item_l[0]+item_l[1]
print(sum)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

bell = [a,b,c]
s_bell = sorted(bell)
print(s_bell[0]+s_bell[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
abc=list(map(int,input().split()))
abc.sort()
print(sum(abc)-abc[-1])

Submission status: Accepted

Solution code:
#ABC066A
p = list(map(int, input().split()))
p = sorted(p)
print(p[0]+p[1])

Submission status: Accepted

Solution code:
*a, _ = sorted(map(int, input().split()))
print(sum(a))

Submission status: Accepted

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

Submission status: Accepted

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

price_list = [a + b, b + c, c + a]

print(min(price_list))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
prices = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
s = sorted([int(x) for x in input().split()])
print(s[0]+s[1])

Submission status: Accepted

Solution code:
s=list(input().split())
a=int(s[0])
b=int(s[1])
c=int(s[2])
s2=[a,b,c]
s2.sort()

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

Submission status: Accepted

Solution code:
*Y,=map(int,input().split());print(sum(Y)-max(Y))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split()
t = map(int, s)
f1 = min(t)
s.pop(s.index(str(f1)))
t = map(int, s)
f2 = min(t)
print(f1 + f2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = sorted(list(map(int, input().split())))
print(sum(n[0:2]))

Submission status: Accepted

Solution code:
A, B, C = sorted(map(int, input().split()))
print(A + B)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
ab = a + b
ac = a + c
bc = b + c
if ab > ac:
    if ac > bc:
        print(bc)
    else:
        print(ac)
else:
    if ab > bc:
        print(bc)
    else:
        print(ab)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

li = sorted(na())
print(li[0] + li[1])

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]

A.sort()

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

Submission status: Accepted

Solution code:
price = list(map(int, input().split()))
price = sorted(price)

print(sum(price[:2]))

Submission status: Accepted

Solution code:
b = list(map(int, input().strip().split(' ')))
print(sum(b)-max(b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=tuple(map(int,input().split()))
print(sum(A)-max(A))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(A + B + C - max([A, B, C]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, input().split())
    return min(a+b, b+c, c+a)

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = a+b
y = b+c
z = c+a

ans = min([x,y,z])

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
l.sort()
print(sum(l[:2]))

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))

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

Submission status: Accepted

Solution code:
nums = list(map(int,input().split()))
sum = 0
for num in nums:
    sum += num
print(sum - max(nums))

Submission status: Accepted

Solution code:
num = list(map(int,input().split()))
lp = 0
while lp < len(num)-1:
    rp = len(num)-1
    while rp > lp:
        if num[rp] < num[rp-1]:
            x = num[rp]
            num[rp] = num[rp-1]
            num[rp-1] = x
        rp -= 1
    lp += 1
print(num[0]+num[1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
a, b, c = sorted([a, b, c])
r = a + b
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L,C,R = map(int,input().split())
print(L+C+R-max(L,C,R))