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:
#! -*- coding:utf-8 -*-
arr = input().split()
for i in range(len(arr)):
    arr[i] = int(arr[i])
arr.sort()

s = 0
for i in range(2):
    s += arr[i]

print(s)

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, raw_input().split(" "))

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

print(min(values))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st = input().split()
a = int(st[0])
b = int(st[1])
c = int(st[2])

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

Submission status: Accepted

Solution code:
a, b, c = [int(x) for x in input().split()]
if a >= b and a >= c:
	print(b + c)
elif b >= a and b >= c:
	print(a + c)
else:
	print(a + b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

quit()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


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

f()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()

print a[0] + a[1]

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

from __future__ import division, print_function
import sys


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


if __name__ == '__main__':
    main()

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:
# coding: utf-8
def get_ln_inputs():
    return input().split()


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


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


main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
lst = input().split()

for i in range(3):
   lst[i] = int(lst[i])
   lst.sort()

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

Submission status: Runtime Error

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

def answer(a: int, b: int, c: int) -> int:
    return min(a + b, a + c, b + c)

print(answer(a, b, c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
!pip install numpy

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys 

N = int(input())
A = list(map(int, input().split()))


if N == 1:
    print(A[0])
    sys.exit()

mae = []
usiro = []

#0の時に前 1の時に後ろ
Flag = 0

for i in reversed(range(0,N,1)):
    
    if Flag == 0: # 前の時
        mae.append(str(A[i]))
        mae.append(" ")
        Flag = 1
    else:
        usiro.insert(0,str(A[i]))
        #usiro.insert(0,str(" "))
        Flag = 0

moziretu = (mae + usiro)
#del moziretu[((len(moziretu))//2)]
moziretu = ''.join(moziretu)
print(moziretu)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = list(int(input().split()))
print(sorted(a)[-1] + sorted(a)[-2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(m(min))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()

a_even = list(filter(lambda x: x % 2 == 0, a))
a_odd = list(filter(lambda x: x % 2 != 0, a))

ans = a_even[::-1] + a_odd
if n % 2 != 0:
  ans = ans[::-1]

print(' '.join(map(str, ans)))

Submission status: Runtime Error

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

a_even = list(filter(lambda x: x % 2 == 0, a))
a_odd = list(filter(lambda x: x % 2 != 0, a))

ans = a_even[::-1] + a_odd
if n % 2 != 0:
  ans = ans[::-1]

print(' '.join(map(str, ans)))

Submission status: Runtime Error

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

a_even = list(filter(lambda x: x % 2 == 0, a))
a_odd = list(filter(lambda x: x % 2 != 0, a))

ans = a_even[::-1] + a_odd
if n % 2 != 0:
  ans = ans[::-1]

print(' '.join(map(str, ans)))

Submission status: Runtime Error

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    def find_duplicate(L):
        n = len(L)
        table = [None] * n
        for i, num in enumerate(L):
            if table[num] is not None:
                return table[num], i
            else:
                table[num] = i

    def make_factorial_table(size, mod):
        '''
        fact_mod[i] は i! % mod を表す。fact_mod[0] ~ facto_mod[size] まで計算可能なテーブルを返す
        >>> make_factorial_table(20, 10**9+7)
        [1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600, 227020758, 178290591, 674358851, 789741546, 425606191, 660911389, 557316307, 146326063]
        '''
        fact_mod = [1] * (size + 1)
        for i in range(1, size + 1):
            fact_mod[i] = (fact_mod[i - 1] * i) % mod
        return fact_mod

    def combination(n, r, mod, fact_table):
        '''
        フェルマーの小定理 
        a ^ p-1 ≡ 1 (mod p)
        a ^ p-2 ≡ 1/a (mod p) (逆元)
        nCr = (n!) / ((n-r)! * r!) だが、mod p の世界ではこの分母を逆元を用いて計算しておくことが可能
        
        >>> m = 1000000007
        >>> fact_table = make_factorial_table(100, m)
        >>> combination(10, 5, m, fact_table)
        252
        >>> combination(100, 50, m, fact_table)
        538992043
        '''
        if r > n:
            return 0
        numerator = fact_table[n]
        denominator = (fact_table[n-r] * fact_table[r]) % mod
        # pow はすでに繰り返し二乗法で効率的に実装されている
        return (numerator * pow(denominator, mod-2, mod)) % mod

    n = ii()
    L = lmi_0()
    i, j = find_duplicate(L)
    fact = make_factorial_table(n+1, mod)

    for l in range(1, n+2):
        print((combination(n+1, l, mod, fact) - combination(i+n-j, l-1, mod, fact)) % mod)




if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(a+b)

Submission status: Runtime Error

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

print(a+b)

Submission status: Runtime Error

Solution code:
from collections import deque

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

b = deque()
for i in range(n):
    b.append(a[i])
    b.reverse()

print(*b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#abc066d
mod=10**9+7

def com(n,r,m):
 f=[1,1]
 for i in range(2,n+1):
  f.append(f[i-1]*i%m)
 return f[n]*pow(f[r]*f[n-r]%m,m-2,m)%m


N=int(raw_input())
A=map(int,raw_input().split())
c=[-1]*N
for i in range(N+1):
 if c[A[i]-1]!=-1:
  break
 c[A[i]-1]=i
j=c[A[i]-1]
i=N-i
for k in range(1,N+2):
 res=com(N+1,k,mod)
 if k-1<=i+j:
  res-=com(i+j,k-1,mod)
 print res%mod

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = list[input().split()]
m = sorted(n)
print(m[0]+m[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
def total_cost(num1, num2, num3):
    if num1 >= num2 and num1 >= num3:
        return num2 + num3
    elif num2 >= num1 and num2 >= num3:
        return num1 + num3
    elif num3 >= num1 and num3 >= num2:
        return num1 + num2
    elif num1 == num2 == num3:
        return num1 + num2

print(total_cost(int(input()), int(input()), int(input())))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = [int(input()) for _ in range(3)]
s = sorted(l)[::-1]
ans = s[0] + s[1]
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

s.sort()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
A,B,C=input().split()
a=int(A)
b=int(B)
c=int(c)
if a>b:
  if a>c:
    x=b+c
  else:
    x=a+b
else:
  if b>c:
    x=a+c
  else:
    x=a+b
print(x)

Submission status: Runtime Error

Solution code:
A,B,C=input().split()
a=int(A)
b=int(B)
c=int(c)
n=max(a,b,c)
x=a+b+c-n
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#66

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

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

Submission status: Runtime Error

Solution code:
print(sum([int(x) for x in input().split()].sort()[0:1]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=gets.split.map &:to_i
print(a.sum-a.max)

Submission status: Runtime Error

Solution code:
ls = list(input())
l = len(ls)
from collections import Counter

for i in range(l):
    ls.pop(-1)
    ls.pop(-1)
    c = Counter(ls)
    if all(j%2==0 for j in c.values()):
        print(len(ls))
        break

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
    vector<int> H(3);
    cin >> H[0] >> H[1] >> H[2];
    sort(H.begin(),H.end());
    cout << H[0] + H[1] << endl; 
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

mod = int(1e9+7)
def powermod(a, n, mod):
    r = 1
    while n>=1:
        if n%2:
            r = r*a%mod
        a = a*a%mod
        n = n//2
    return r
  
memo={}
for i, a in enumerate(A):
  if a in memo:
    L = memo[a]
    C = i - memo[a] -1
    R = len(A) - i-1
    break
  else:
    memo[a] = i
    
#print(L,C,R)
_LR = [0]*(n+3)
_LCR = [0] * (n+3) # _LCR[k] = (L+C+R)C(k)
_k = [0] * (n+3)
_LR[0] = _LCR[0] = _k[0] = 1

LR = [0]*(n+2) #LR[k] = (L+R)C(k)
LR[0] = 1
#LDR = [0]*(n+2)
#LDDR = [0]*(n+2)

LCR = [0] * (n+2) # LCR[k] = _LCR[k] - LR[k]
#LDCR = [0] * (n+2) #最後に*2を忘れないこと
#LDCDR = [0] * (n+2)

for k in range(1,n+2):
  _LR[k] = (_LR[k-1] * (L+R+1-k)) %mod
  _LCR[k] = (_LCR[k-1] * (L+C+R+1-k))% mod
  _k[k] = (_k[k-1] * powermod(k, mod-2, mod)) %mod
  
  LR[k] = (_LR[k] * _k[k])%mod
#  LDR[k] = LR[k-1]
#  LDDR[k] = LDR[k-1]
  
  LCR[k] = (_LCR[k] * _k[k])%mod - LR[k]
#  LDCR[k] = LCR[k-1]
#  LDCDR[k] = LDCR[k-1]
  #print(LR, LCR)
  print((LR[k] + LR[k-1] + LR[k-2] + LCR[k] + 2*LCR[k-1] + LCR[k-2])%mod)
  
#print(LR)
#print(LDR)
#print(LDDR)
#print(_LCR)
#print(LCR)
#print(LDCR)
#print(LDCDR)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = gets.split.map(&:to_i).sort!
puts a[0] + a[1]

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:

n = int(input())
a = list(map(int,input().split()))
b = ["A" for i in range(1000001)]

for i in range(n):
    if i % 2 != 0:
        b.append(a[i])
    else:
        b[1000000-i] = a[i]

while b[0] == "A" :
    del b[0]

while "A" in b:
    b.remove("A")

if n % 2 != 0:
    pass
else:
    b.reverse()

for i in range(len(b)):
    if i == len(b) - 1:
        print(b[i])
        break
    print(b[i],end = " ")

Submission status: Runtime Error

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

n = int(input())
a = list(map(int,input().split()))
b = ["A" for i in range(1000001)]

for i in range(n):
    if i % 2 != 0:
        b.append(a[i])
    else:
        b[1000000-i] = a[i]

while "A" in b:
    b.remove("A")

if n % 2 != 0:
    pass
else:
    b.reverse()

for i in range(len(b)):
    if i == len(b) - 1:
        print(b[i])
        break
    print(b[i],end = " ")

Submission status: Runtime Error

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

n = int(input())
a = list(map(int,input().split()))
b = []

for i in range(n):
    if i % 2 != 0:
        b.append(a[i])
    else:
        c = [0] + b[:]
        c[0] = a[i]
        b = c

if n % 2 != 0:
    pass
else:
    b.reverse()

for i in range(len(b)):
    if i == len(b) - 1:
        print(b[i])
        break
    print(b[i],end = " ")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
abc = [int(input().split())]
print(sum(abc) - max(abc))

Submission status: Runtime Error

Solution code:
abc = [int(input())]
print(sum(abc) - max(abc))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

a = [int(i) for i in input().split()]
b = []
for i in range(len(a)):
    b.append(a[i])
    b = b[::-1]
    print(b)

Submission status: Runtime Error

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

if n == 1:
    print(1)
    print(1)
    exit()

MOD = 10 ** 9 + 7

b = sorted(a)

for i in range(n):
    if b[i] == b[i + 1]:
        d = b[i]
        break

p = []
for i in range(n):
    if a[i] == d:
        p.append(i)

w = p[0] + n - p[1]

c = [0 for _ in range(n + 2)]

temp = 1
for i in range(1, n + 2):
    temp *= i
    c[i] = temp

def cmb(x, y):
    if y < 0 or y > x:
        return 0
    elif x == y:
        return 1
    else:
        return c[x] // c[y] // c[x - y] % MOD


print(n)
for k in range(2, n + 2):
    ans = cmb(n + 1, k) - cmb(w, k - 1)
    print(ans % MOD)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
lines = list(str.split())
a = int(lines[0])
b = int(lines[1])
c = int(lines[2])
sum_list = [a+b, a+c, b+c]
print(min(sum_list))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if(a>=b)and(a>=c):
    d=b+c
elif(b>=a)and(b>=c):
    d=a+c
elif(c>=b)and(c>=a):
    d=b+a
print(d)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if(a>=b)and(a>=c)and(b>=c):
    d=b+c
elif(b>=a)and(b>=c)and(a>=c):
    d=a+c
elif(c>=b)and(c>=a)and(a>=b):
    d=b+a
print(d)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if(a>=b)and(a>=c)and(b>=c):
    d=b+c
elif(b>=a)and(b>=c)and(a>=c):
    d=a+c
elif(c>=b)and(c>=a)and(a>=b):
    d=b+a
print(d)

Submission status: Runtime Error

Solution code:
a=[0,0,0]
a[0]=int(input())
a[1]=int(input())
a[2]=int(input())

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

Submission status: Runtime Error

Solution code:
a=[0,0,0]
for i in range(3):
    a[i]=int(input())
a.sort()
b=a[0]+a[1]
print(b)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=a+b
e=a+c
f=b+c
if(d>e):
    if(f>e):
        print(e)
    else:
        print(f)
elif(e>d):
    if(d>f):
        print(f)
    else:
        print(d)
elif(f>d):
    if(d>e):
        print(e)
    else:
        print(d)