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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
input = sys.stdin.readline


def main():
    l = list(map(int, input().split()))
    l.sort()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(abc) for abc in input().split()]
ans = a + b + c - max(a, b, c)
print(ans)

Submission status: Accepted

Solution code:
prices = list(map(int,input().split()))
prices.sort()
print(prices[0]+prices[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:
L = list(map(int, input().split(' ')))
L = sorted(L)
print(L[0]+L[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def test():
    x = list(map(int,input().split()))
    result = 0
    for i in range(len(x)-1):
        result += min(x)
        x.remove(min(x))

    print(result)


if __name__ == "__main__":
    test()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    a,b,c = map(int,input().split())
    print(min(a+b,a+c,b+c))
    
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:
array = [int(i) for i in input().split()]
array.sort()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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(a+b if a+b <= a+c and a+b <= b+c else a+c if a+c <= a+b and a+c <= b+c else b+c)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = map(int , input().split())

s = [a+b , b+c , a+c]
ans = 999999
for i in s:
    ans = min(i , ans)
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(a: int, b: int, c: int):
    print(sum([a, b, c])-max(a, b, c))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c = list(map(int, input().split(' ')))
print(sum(sorted(c)[:-1]))

Submission status: Accepted

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

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:
a = list(map(int,input().split()))
print(sum(a) - max(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
#66

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(sum(a[1:]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b,c = inputMap()
    
    tmp = []
    tmp.append(a)
    tmp.append(b)
    tmp.append(c)
    tmp.sort()
    
    print(tmp[0] + tmp[1])
        
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import combinations
a,b,c = map(int, input().split())
ans = float("INF")
for i in combinations([a,b,c],2):
    ans = min(ans, sum(i))
print(ans)

Submission status: Accepted

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

t.remove(max(t))

print(sum(t))

Submission status: Accepted

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

Submission status: Accepted

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

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

# solve & output
print(min(a + b, a + c, 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, b, c = map(int, input().split())
print(sum((a,b,c)) - max(a, b, c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
a,b,c = [int(i) for i in input().split()]

if (a + b) <= (b + c) and (a + b) <=(c + a):
    print(a + b)
elif(b + c) <= (a + b) and (b + c)<= (c + a):
    print(b +c)
elif(c + a) <= (a + b) and (c + a) <= (b + c):
    print(c + a)

Submission status: Accepted

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

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())
print(a+b+c -max(a,b,c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d = max(a, b, c)

print(a + b + c - d)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

l = LIST()
comb = list(combinations(l, 2))
m_l = []
for c in comb:
    m_l.append(sum(c))

ans = min(m_l)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    print(min(a+b,b+c,c+a))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC66 A

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

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

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

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=map(int,input().split())
print(sum(sorted(a)[0:2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#x, y = map(int,input().split())
ls = list(map(int,input().split()))
#r = int(input())
#s = input()
#x, y = input().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(nums[0:2:]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b = sorted(a)
print(b[0]+b[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:


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



if __name__ == '__main__':
    main()

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 = sorted(list(map(int, input().split())))
print(s[0]+s[1])

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

abc_list.sort()

# print(abc_list[0])
# print(abc_list[1])
# print(abc_list[2])

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b, c = nl()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(a: int, b: int, c: int):
    ret = sum([a,b,c]) - max([a,b,c])
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = [int(s) for s in input().split()]
print(sum(sorted(N)[:2]))

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:
n = list(map(int, input().split()))
n.sort()
print(n[0] + n[1])

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b, c = [int(ele) for ele in input().split()]
    ab = a + b
    bc = b + c
    ca = c + a
    ans = min([ab, bc, ca])
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a = list(map(int,input().split()))

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

Submission status: Accepted

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

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 = [int(x) for x in input().split()]
max_ = max(a, b, c)
print(a+b+c-max_)

Submission status: Accepted

Solution code:
def resolve():
    ls = []

    for s in map(int, input().split(' ')):
        ls.append(s)

    ls.sort()
    print(ls[0] + ls[1])
    pass


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans1 = a+b
ans2 = a+c
ans3 = c+b

print(min(ans1,ans2,ans3))

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 = sorted(list(map(int,input().split())))
print(a[0] + a[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int,input().split()))
m = min(s)
s.remove(m)
print(m+min(s))

Submission status: Accepted

Solution code:
list_num = [int(num) for num in input().split()]
list_num.sort(reverse=False)

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

Submission status: Accepted

Solution code:
import itertools

a, b, c = map(int, input().split())
print(min(map(sum, itertools.combinations((a, b, c), 2))))

Submission status: Accepted

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

bell=sorted(bell,reverse=True)

print(bell[1]+bell[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
s = a + b
x = b + c
y = a + c
min = a + b + c
if s > x:
    min = x
else:
    min = s
if min > y:
    min = y
print min

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = sorted(list(map(int, input().split())))
print(nums[0]+nums[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:
abc = list(map(int, input().split()))

abc.sort()

print(sum(abc[:2]))

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())
A = a+b
B = b+c
C = c+a
K = min(A,B,C)
print(K)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

#N = int(input())
#A = [int(x) for x in input().split()]
#a, b, c = map(int, input().split())
#name1 = str(input())
#alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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(" "))
print(min(a+b,b+c,c+a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(a+b+c-max(a,b,c))

Submission status: Accepted

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

Submission status: Accepted

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

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 =[int(i) for i in input().split()]
a.remove(max(a))
print(sum(a))

Submission status: Accepted

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

m=a+b+c-max(a,b,c)

print(m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

    return a, b, c


def submit():
    a, b, c = read_input()

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

if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b,c = f()
    print(a+b+c - max(a,b,c))

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
ans = 0
for i in l:
    ans += i
print(ans - max(l))

Submission status: Accepted

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

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:
a = [int(i) for i in input().split()] 

a = sorted(a)

print(sum(a[0:2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC066A - ringring
a, b, c = sorted(list(map(int, input().rstrip().split())))
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:
p = sorted([int(n) for n in input().split()])

print(sum(p[:2]))

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    a, b, c = (int(_) for _ in input().split())
    
    print(min(a+b,b+c,a+c))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
ans += min(a)
a.pop(a.index(ans))
ans += min(a)
print(ans)

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=[int(i) for i in input().split()]
print(sum(A)-max(A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = sorted([int(item) for item in input().split()])
print(sum(a[:-1]))

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
x.sort()
print(x[0]+x[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:
prices = sorted(list(map(int, input().split())))
print(sum(prices[:2:]))

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:
bells=[int(i) for i in input().split()]
print(sum(bells)-max(bells))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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