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,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)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(a+b)

Submission status: Accepted

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

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

print(min(A,B,C))

Submission status: Accepted

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

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()))
new=sorted(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b,c = map(int,input().split())
print(min(a+b,b+c,c+a))

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ring.sort()

print(sum(ring[:2]))

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:
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()

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:
icase=0    
if icase==0:
    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(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())
print(min(a+b,b+c,a+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:
def main():
    a, b, c = map(int, input().split())
    p_list = sorted([a, b, c])
    print(p_list[0] + p_list[1])
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, b, c = map(int, input().split())

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

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

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())
ans = min(a+b, b+c, 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:
a, b, c = map(int, input().split())
print( a+b+c - max(a,b,c) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(abc[0]+abc[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 = list(map(int, input().split()))
a.remove(max(a))
print(sum(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:
b = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

ans = sum(X) - max(X)

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:
a,b,c=map(int,input().split())
print(min((a+b),(a+c),(b+c)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

min_ = a_b
if a_c < min_:
    min_ = a_c
if b_c < min_:
    min_ = b_c

print(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:
# coding: utf-8
a, b, c = map(int, input().split())
print(min(a + b, b + c, c + a))

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc066/tasks/abc066_a

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

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

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

Submission status: Accepted

Solution code:
import itertools
def main():
  s = list(map(int,input().split()))
 # m = itertools.combinations(s,2)
  ans = float("inf")
#  print(m)
  for m in itertools.combinations(s,2):
    ans = min(ans,sum(m))
  print(ans)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC066A
a,b,c = map(int,input().split())
if (a == b)&(b == c):
    print(a + b)
elif(a > b)&(a > c):
    print(b + c)
elif (b > a)&(b > c):
    print(a + c)
elif (c > a)&(c > b):
    print(a + b)

Submission status: Accepted

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

if a >= b and a >= c:
	answer = b + c
elif b >= a and b >= c:
	answer = a + c
elif c >= a and c >= b:
	answer = a + b

print(answer)

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:
import sys

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

def main():
    print(c[0] + c[1])

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    a.sort()

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

t.sort()

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

Submission status: Accepted

Solution code:
import math

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

print(a+b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import itertools
m = list(map(int,input().split()))
l = [sum(t) for t in list(itertools.combinations(m, 2))]
print(min(l))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
# Problem A - ringing

from itertools import combinations

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

# initialization
combi_list = list(combinations(['A', 'B', 'C'], 2))
min_cost = 30000

# count
for combi in combi_list:
    tmp = 0
    if combi[0]=='A':
        tmp += a
    elif combi[0]=='B':
        tmp += b
    else:
        tmp += c

    if combi[1]=='A':
        tmp += a
    elif combi[1]=='B':
        tmp += b
    else:
        tmp += c

    min_cost = min(min_cost, tmp)

# output
print(min_cost)

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

del bells[bells.index(max(bells))]

print(sum(bells))

Submission status: Accepted

Solution code:
a, b, c = map(int,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, b, c))

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(A) - max(A))

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = [int(x) for x in input().split(' ')]
t.sort()
print(t[0]+t[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input() .split())
d = a + b
e = b + c
f = a + c
print min(d, e, f)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=list(map(int, input().split()))
x.sort()
print(x[0]+x[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 - ringring
a,b,c=list(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())
numbers=[]
numbers.append(a)
numbers.append(b)
numbers.append(c)
numbers.remove(max(numbers))
print(sum(numbers))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a+b)

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    a, b, c = list(map(int,ipti().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())
print(A + B + C - max(A, B, C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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,b+c,a+c))

Submission status: Accepted

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

Submission status: Accepted

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

max =max(a,b,c)

print(a+b+c-max)

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a,b,c=MI()
    print(a+b+c-max(a,b,c))

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

    a,b,c = map(int, input().split())
    print(min(a+b,a+c, b+c))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 =sorted(map(int,input().split()))
print(a+b)

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())
price = [a, b, c]
price.sort()
print(price[0] + price[1])

Submission status: Accepted

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

Submission status: Accepted

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

a,b,c=[int(i) for i in input().rstrip().split()]
#-----
sum_abc = a+b+c

ans=10000*2
for i in [a,b,c]:
    ans = min(ans, (sum_abc - i))

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S,M,L=sorted(list(map(int,input().split())))
print(S+M)

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

Submission status: Accepted

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

ans = sum(abc) - max(abc)
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a<=b<=c or b<=a<=c:
  print(a + b)
elif a<=c<=b or c<=a<=b:
  print(a + c)
else:
  print(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:
# AtCoder Beginner Contest 066
# A - ringring / 
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: stdin.readline().split()

a = na()
a.sort()
print(a[0] + a[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([b+c,c+a,a+b]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = sorted(list(map(int, 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())

l=[a,b,c]
l.sort()
print(l[0]+l[1])

Submission status: Accepted

Solution code:
def miner(a):
    
    a.sort()
    ans = int(a[0]) + int(a[1])
    return ans

def main():
    a = list(map(int , input().split()))
    print(miner(a))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
m = [a, b, c]
maxvalue = 0
for i in range(len(m)):
    if m[i] > maxvalue:
        maxvalue = m[i]
print(a+b+c-maxvalue)

Submission status: Accepted

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

ans = min(ab,ac,bc)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力 : 数字3つ
a, b, c = map(int, input().split())

# 出力　小さい2つの和

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

min = l[0]

for i in l:
    if min > i:
        min = i

print(min)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    A, B, C = map(int, input().split())
    print(sum(sorted([A, B, C])[:2]))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

List = [a+b, b+c, c+a]
List.sort()

print(List[0])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a = [int(i) for i in readline().split()]
a.sort()
print(sum(a[: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:
S=sorted(list(map(int,input().split())))
print(sum(S[:2]))

Submission status: Accepted

Solution code:
p,q,r=map(int,input().split())
print(p+q+r-max([p,q,r]))

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:
#!/usr/bin/env python3
a = list(map(int,input().split()))
print(sum(a)-max(a))

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

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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b, c = MAP()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
answer = float('inf')
if a+b<=answer:
    answer=a+b
if c+b<=answer:
    answer=c+b
if a+c<=answer:
    answer=a+c
print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

lists = [a,b,c]

lists = sorted(lists)

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a+b)

Submission status: Accepted

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

Submission status: Accepted

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

print(int(r))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num = input().split()
num_i = [int(s) for s in num]

a,b,c = num_i
min_1 = a+b
min_2 = b+c
min_3 = c+a

min_a1 = min(min_1, min_2)
min_a = min(min_a1, min_3)
print(min_a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


import numpy as np
import fractions as fra

a=[int(x) for x in input().split()]
a=sorted(a)

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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