Problem:


Score : 100 points

Problem Statement

You have decided to give an allowance to your child depending on the outcome of the game that he will play now.

The game is played as follows:

There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a + printed on it.

The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)

Then, the amount of the allowance will be equal to the resulting value of the formula.

Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.

Constraints

All values in input are integers.

1 \leq A, B, C \leq 9

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the maximum possible amount of the allowance.

Sample Input 1

1 5 2

Sample Output 1

53

The amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.

Sample Input 2

9 9 9

Sample Output 2

108

Sample Input 3

6 6 7

Sample Output 3

82



Sample input:
1 5 2


Sample output:
53

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inpt = map(int, raw_input().split())
inpt = sorted(inpt)
print inpt[0]+inpt[1]+10*inpt[2]

Submission status: Accepted

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

Submission status: Accepted

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

Sum = a+b+c

Max = max(a,b,c)

print(Max*10+Sum-Max)

Submission status: Accepted

Solution code:
a = input().split()
a = [int(i) for i in a]
amax = a[0]
count = 0
for i in range(1,3):
    if a[i] > amax:
        amax = a[i]
        count = i
    else:
        pass
a.pop(count)
print(amax*10+a[0]+a[1])

Submission status: Accepted

Solution code:
# coding: utf-8
 
a, b, c = map(int, input().split())
 
x = a*10 + b
y = b*10 + c
z = c*10 + a
 
if x >= y and x >= z:
    print(x + c)
elif y >= x and y >= z:
    print(y + a)
else:
    print(z + b)

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))
ABC = [int(str(A)+str(B))+C, int(str(A)+str(C))+B, int(str(B)+str(A))+C, int(str(B)+str(C))+A, int(str(C)+str(A))+B, int(str(C)+str(A))+B]

print(max(ABC))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
X , Y, Z = sorted([A, B, C], reverse=True)
ans = 10 * X + Y + Z
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

data.sort(reverse=True)

answer = data[0] * 10 + data[1] + data[2]

print(answer)

Submission status: Accepted

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

print(n[0] +n[1] + n[2] + max(n) *9)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a1,a2,a3 = map(int,input().split())

list = [a1,a2,a3]
list.sort()

x = 10*list[2]+list[0]+list[1]
print(x)

Submission status: Accepted

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

num = sorted([A,B,C],reverse=True)
print(eval(str(num[0])+str(num[1])+'+'+str(num[2])))

Submission status: Accepted

Solution code:
s = input().split(" ")
s = [int(i) for i in s]
m = max(s)
print(10*m + sum(s) - m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x, y, z = map(int, input().split())
a =max( [ x, y, z ] )
if x == a:
	print (a*10 + y + z)
elif y == a:
	print (a*10 + z + x)
elif z == a:
	print (a*10 + x + y)

Submission status: Accepted

Solution code:
a = raw_input()
nums = a.split()
nums = [int(i) for i in nums]
nums.sort()
ans = nums[-1]*10 + nums[0] + nums[1]
print(ans)

Submission status: Accepted

Solution code:
ABX = list(map(int, input().split()) )
L = sorted(ABX, reverse = True)
print(L[0] * 10 + L[1] + L[2])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
l=[a,b,c]
l.sort()
t=l[2]*10+l[1]+l[0]
print(t)

Submission status: Accepted

Solution code:
import io
import sys



# 関数 solve は，もちろん，問題に応じて書き換える
def solve(a):
    list1 = sorted(a)
    ab = str(list1[2])+str(list1[1])
    return int(ab)+int(list1[0])

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():

    line = sys.stdin.readline().rstrip()
    listabc = line.split(" ")
    return listabc

def main():
    n = readQuestion()
    answer = solve(n)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
l=list(map(int,input().split()))
l.sort(reverse=True)

print(l[0]*10+l[1]+l[2])

Submission status: Accepted

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

ma=max(li)
li.remove(ma)

print(ma*10+li.pop()+li.pop())

Submission status: Accepted

Solution code:
line = input().split()
line.sort()
a = int(line[2] + line[1])
b = int(line[0])
print(a + b)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
abc =list(map(int,input().split(" "))) 
m = max(abc)
s = sum(abc)
ans = s-m+(m*10)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    A, B, C = map(int, input().split())
    if A >= B and A >= C:
        print(10 * A + B + C)
    elif B >= A and B >= C:
        print(10 * B + A + C)
    elif C >= B and C >= A:
        print(10 * C + A + B)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np
 
inp = np.asarray(input().split(), dtype=int)
inp = np.sort(inp)
print(np.sum(inp)+inp[2]*9)

Submission status: Accepted

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

a = sorted(a)

print(a[2] * 10 + sum(a[:2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = (int(i) for i in input().split())

answer = max(A,B,C)*10 + (A+B+C-max(A,B,C))

print(answer)

Submission status: Accepted

Solution code:
print(eval(''.join(sorted(input()+'++')*4)[6::5]))

Submission status: Accepted

Solution code:
abc = list(map(int,input().split()))
o = max(abc)*10
abc.remove(max(abc))
o += sum(abc)
print(o)

Submission status: Accepted

Solution code:
*x,=map(int,input()[::2]);print(max(x)*9+sum(x))

Submission status: Accepted

Solution code:
num = sorted(list(map(int, (input().split()))), reverse=True)
x, y = num[:2], num[-1]
print(int(''.join(map(str, x))) + y)

Submission status: Accepted

Solution code:
a,b,c =map(int,input().split())
ans = []
ans.append(10 * a + b + c)
ans.append(10 * b + a + c)
ans.append(10 * c + b + a)

print(max(ans))

Submission status: Accepted

Solution code:
data = sorted(input().split(), reverse=True)
print(int(data[0] + data[1]) + int(data[2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_lines = input().split()
sort_lines = sorted(input_lines,reverse=True)
big_num = int(sort_lines[0]+sort_lines[1])
answer = int(sort_lines[2])+big_num
print(answer)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split(" "))
numbers = sorted([a, b, c])
print(numbers[-1] * 10 + numbers[1] + numbers[0])

Submission status: Accepted

Solution code:
x, y, z = map(int,input().split())

max_lines = [[x * 10 + y, z],
                 [x * 10 + z, y],
                 [y * 10 + x, z],
                 [y * 10 + z, x],
                 [z * 10 + x, y],
                 [z * 10 + y, x]]

max_point = 0
one_point = 0
for max_line in max_lines:
    if max_line[0] >= max_point:
        max_point = max_line[0]
        one_point = max_line[1]

print(max_point + one_point)

Submission status: Accepted

Solution code:
a = input()
b = []

for x in a:
    if x == " ":
        pass
    else:
        b.append(int(x))


# abc
# ab+c
# ac+b
# ba+c
# bc+a
# ca+b
# cb+a

# a = b[0], b = b[1], c = b[2]

b0_str = str(b[0])
b1_str = str(b[1])
b2_str = str(b[2])

# ab+c
b01_str = b0_str + b1_str
ab_c = int(b01_str) + b[2]

# ac+b
b02_str = b0_str + b2_str
ac_b = int(b02_str) + b[1]

# ba+c
b10_str = b1_str + b0_str
ba_c = int(b10_str) + b[2]

# bc+a
b12_str = b1_str + b2_str
bc_a = int(b12_str) + b[0]

# ca+b
b20_str = b2_str + b0_str
ca_b = int(b20_str) + b[1]

# cb+a
b21_str = b2_str + b1_str
cb_a = int(b21_str) + b[0]

max_ans = 0
if max_ans < ab_c:
    max_ans = ab_c
if max_ans < ac_b:
    max_ans = ac_b
if max_ans < ba_c:
    max_ans = ba_c
if max_ans < bc_a:
    max_ans = bc_a
if max_ans < ca_b:
    max_ans = ca_b
if max_ans < cb_a:
    max_ans = cb_a

print(max_ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
x = list(map(int,input().split()))
Max = max(x)
x.remove(Max)
Sum = sum(x)
Sum = Sum + (Max * 10)
print(Sum)

Submission status: Accepted

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

l.sort()

print(l[2]*10+l[1]+l[0])

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
a=[A,B,C]
a.sort()
print(a[2]*10+a[1]+a[0])

Submission status: Accepted

Solution code:
# encoding: utf-8
abc = list(map(int, input().split()))
abc.sort()

print(10 * abc[-1] + abc[-2] + abc[-3])

Submission status: Accepted

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

a = max(l)
l.remove(a)
print(a*10 + l[0] + l[1])

Submission status: Accepted

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

xs = list(reversed(xs))
#print(xs)
head = int( ''.join([str(x) for x in xs[0:2]]) )
tail = xs[-1]

print(head + tail)

Submission status: Accepted

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

Submission status: Accepted

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

print(int(str(ABC[2]) + str(ABC[1])) + ABC[0])

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    a = LI()
    t = max(a)

    return t * 9 + sum(a)


print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ipt=list(map(int,input().split()))
imax=max(ipt)
ipt.remove(imax)
print(10*imax+sum(ipt))

Submission status: Accepted

Solution code:
import itertools

n = list(map(str, raw_input().split()))
n.append('+')
nc = list(itertools.permutations(n))
ncc = []
vn = []
for _ in nc:
    if _[0] != '+' and _[3] != '+':
        ncc.append(_)
for __ in ncc:
    v = eval(('').join(__))
    vn.append(v)
print(max(vn))

Submission status: Accepted

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

Submission status: Accepted

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

def ans1(): # 全ての組み合わせを調べる
    return max([
        10*A + B + C, # 10*A + C + B, 
        10*B + A + C, # 10*B + C + A, 
        10*C + A + B, # 10*C + B + A, 
    ])

def ans2():
    return A + B + C + 9*max([A, B, C])

#print(ans1())
print(ans2())

Submission status: Accepted

Solution code:
a, b, c = input()[::2]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#abc110a

a,b,c=map(int,raw_input().split())
l=[a,b,c]
l.sort(reverse=True)
res=l[0]*10+l[1]+l[2]
print res

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    a = list(map(int, input().split()))
    a.sort(reverse=True)

    print(a[0]*10+a[1]+a[2])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lis=sorted(map(int,raw_input().split()))
print lis[2]*10+lis[1]+lis[0]

Submission status: Accepted

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

Submission status: Accepted

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

# スペース区切りの整数の入力
a, b, c = map(int, input().split())

if a > b:
	if a > c:
		print("{}".format((a*10)+b+c))
	else:
		print("{}".format(a+b+(c*10)))
else:
	if b > c:
		print("{}".format(a+(b*10)+c))
	else:
		print("{}".format(a+b+(c*10)))

Submission status: Accepted

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

m = max(L)
i = L.index(m)
score=m*10
for j in range(3):
    if j!=i:
        score+=L[j]
print score

Submission status: Accepted

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

A, B, C = map(int, input().split())

# ようはどれか1つが10の桁になるだけ
print(max(A*10 + B + C, A + B*10 + C, A + B + C*10))

Submission status: Accepted

Solution code:
numbers = input().split(" ")
numbers = list(map(int,numbers))
numbers.sort()
print(numbers[0]+numbers[2]*10+numbers[1])

Submission status: Accepted

Solution code:
x = input().split(' ')
x.sort()
x.reverse()
result = int(x[0])*10 + int(x[1]) + int(x[2])
print(result)

Submission status: Accepted

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

arr.sort()

[a, b, c] = arr
print(c * 10 + b + a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin

s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()

A, B, C = ds_in()
print(max(A, B, C) * (10-1) + (A+B+C))

Submission status: Accepted

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

Submission status: Accepted

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

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

num.sort(reverse = True)

#print(num)
ans = num[0] * 10 + num[1] + num[2]

print(ans)

Submission status: Accepted

Solution code:
#110a
a,b,c=map(int,input().split())
ans=(max(a,b,c)*9 + a+b+c)
print(ans)

Submission status: Accepted

Solution code:
*x,=map(int,input().split());print(sum(x)+max(x)*9)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
m = max(a,b,c)
ans = m*9 + a + b + c

print(ans)

Submission status: Accepted

Solution code:
ary = list(map(int, input().split()))
ans = sum(ary) + 9 * max(ary)
print(ans)

Submission status: Accepted

Solution code:
#coding: utf-8
l=list(map(int,input().split()))
l.sort()
C=l[0]
B=l[1]
A=l[2]
print(10*A+B+C)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
d = max(a)
a.remove(d)
print(10*d + a[0] + a[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(arr[2] * 10 + sum(arr[:2]))

main()

Submission status: Accepted

Solution code:
a, b, c = input().split()
hoge = [a, b, c]
hoge.sort()
hoge.reverse()
x, y, z = hoge
A = int(x + y)
B = int(z)
print(A+B)

Submission status: Accepted

Solution code:
from itertools import permutations

A, B, C = map(int, input().split())

D = -1
for a, b, c in permutations([A, B, C], 3):
    D = max(a * 10 + b + c, D)

print(D)

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
if a >= b and a >= c:
    print(10*a + b + c)
elif b >= a and b >= c:
    print(10*b + a + c)
else:
    print(10*c + a + b)

Submission status: Accepted

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

m = max(a+10*b+c, a+10*c+b)
m = max(m, 10*a+b+c)
print(m)

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
A.sort(reverse=True)
A[0] *= 10

print(sum(A))

Submission status: Accepted

Solution code:
# 数字複数
x, y,z = map(int, input().split())

arr = [x,y,z]

arr.sort()
arr.reverse()

#print(arr)

print(arr[0]*10+arr[1]+arr[2])

Submission status: Accepted

Solution code:
import itertools
a =list(itertools.permutations( list(input().split())))
b =[]
for i in range(len(a)):  
    c = a[i][0] + a[i][1]
    d = int(c) + int(a[i][2])
    b.append(d)
print(max(b))

Submission status: Accepted

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


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

Submission status: Accepted

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

li=[A,B,C]

max_num=max(li)
max_num2=min(li)

for i in li:
    if max_num!=i and max_num2<i:
        max_num2=i
        
num1=int(str(max_num)+str(max_num2))
li.remove(max_num)
li.remove(max_num2)

print(int(num1)+li[0])

Submission status: Accepted

Solution code:
s = input()

num = list(s)

num.sort()
num.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np,math,itertools

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

print(max([10*a+b+c,a+10*b+c,a+b+10*c]))

Submission status: Accepted

Solution code:
array = list(map(int, input().strip().split()))
array.sort(reverse = True)
A = 10 * array[0] + array[1] + array[2]
print(A)

Submission status: Accepted

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

max = 0

for i in range(len(A)):
    if max < (A[i] * 10 + A[(i+1)%len(A)] + A[(i+2)%len(A)]):
        max = A[i] * 10 + A[(i+1)%len(A)] + A[(i+2)%len(A)]
    if max < (A[i] + A[(i+1)%len(A)]*10 + A[(i+2)%len(A)]):
        max = (A[i] + A[(i+1)%len(A)]*10 + A[(i+2)%len(A)])

print max

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()
a.reverse()
print int(a[0]+a[1]) + int(a[2])

Submission status: Accepted

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

Submission status: Accepted

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

print 10 * panels[-1] + panels[-2] + panels[-3]

Submission status: Accepted

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

N.sort()

print(N[2] * 10 + N[1]+ N[0])

Submission status: Accepted

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

a.sort()

print(a[-1] * 10 + a[0] + a[1])

Submission status: Accepted

Solution code:
print((lambda a:sum(a)+max(a)*9)(list(map(int,input().split()))))

Submission status: Accepted

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

x = sorted(x, reverse=True)

print(x[0] * 10 + x[1] + x[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A, B, C = map(int, input().split()) 
res = 10 * A + B + C
if A + 10 * B + C > res:
    res = A + 10 * B + C
if A + B + 10 * C > res:
    res = A + B + 10 * C

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
panel_nums_str = input().split(" ")

panel_nums = []
for num in panel_nums_str:
    panel_nums.append(int(num))

panel_nums.sort()

print(panel_nums[2] * 10 + panel_nums[1] + panel_nums[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
iA,iB,iC =sorted([int(x) for x in input().split()])
print(10*iC+iB+iA)

Submission status: Accepted

Solution code:
num = input().split()
num.sort()
num.reverse()

ans1 = num[0] + num[1]
ans = int(ans1) + int(num[2])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input().split()
n = sorted(n, reverse=True)
 
ans = int(n[0]+n[1]) + int(n[2])
print(ans)

Submission status: Accepted

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

ans=l[0]+l[1]+10*l[2]

print(ans)

Submission status: Accepted

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

num_list.sort()

ans=num_list[2]*10+num_list[1]+num_list[0]

print(ans)

Submission status: Accepted

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

from collections import deque
import itertools as it
import sys
import math

sys.setrecursionlimit(1000000)

ls = map(int, raw_input().split())

print sum(ls) + max(ls) * 9

Submission status: Accepted

Solution code:
import math
array = list(map(int, input().strip().split()))
array.sort()
ans=array[2]*10+array[1]+array[0]


    
print(ans)

Submission status: Accepted

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

input = raw_input().split(" ")
numberlist = [int(i) for i in input]
numberlist.sort(reverse=True)

result = numberlist[0] * 10 + numberlist[1] + numberlist[2]
print result

Submission status: Accepted

Solution code:
import statistics
import math
Num=[int(i) for i in input().split()]
median=statistics.median(Num)
print(max(Num)*10+median+min(Num))

Submission status: Accepted

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

Submission status: Accepted

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

ans= 0

for i in range(6):
  ans = max(a*10+b+c,max(b*10+c+a,c*10+a+b))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    nums = list(map(int, input().split()))
    a = max(nums)
    nums.remove(a)
    print(a*10+nums[0]+nums[1])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input().split(" ")
a.sort()
print(int(a[0]) + int(a[1]) + int(a[2]) * 10)

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(len(lists)):
    lists[i]=int(lists[i])

lists=sorted(lists,reverse=True)
print(lists[0]*10+lists[1]+lists[2])

Submission status: Accepted

Solution code:
#!/usr/bin/env python
a, b, c = sorted(map(int, input().split()))
print(a + b + c * 10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x = [int(s) for s in input().split()]
    x.sort(reverse=True)
    print(x[0] * 10 + x[1] + x[2])

main()

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
L = [A, B, C]
L.sort()
print(L[0] + L[1] + 10 * L[2])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list=[int(n) for n in input().split()]
m=max(list)
list.remove(m)
print(m*10+sum(list))

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F551C':
    sys.stdin = open('a1.in')


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


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


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    a, b, c = read_int_list()
    x = 10 * a + b + c
    y = 10 * b + a + c
    z = 10 * c + a + b
    res = max([x, y, z])
    print(res)


main()

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
if(l.index(max(l))==0):
  print(l[0]*10+l[1]+l[2])
elif(l.index(max(l))==1):
  print(l[1]*10+l[0]+l[2])
else:
  print(l[2]*10+l[1]+l[0])

Submission status: Accepted

Solution code:
# coding: utf-8

nums = input().split(" ")
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
num_list = [a, b, c]

max_num = max(num_list)
min_num = min(num_list)

if max_num == a:
	max_index = 0
elif max_num == b:
	max_index = 1
else:
	max_index = 2

if min_num == a and max_index != 0:
	min_index = 0
elif min_num == b and max_index != 1:
	min_index = 1
else:
	min_index = 2

index_list = [0, 1, 2]
index_list[max_index] = "abc"
index_list[min_index] = "abc"
if index_list[0] == 0:
	middle_index = 0
elif index_list[1] == 1:
	middle_index = 1
else:
	middle_index = 2

answer = int( str(num_list[max_index]) + str(num_list[middle_index]) ) + num_list[min_index]

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for k1, v1 in enumerate(input_data):
    for k2, v2 in enumerate(input_data):
        for k3, v3 in enumerate(input_data):
            if k1 == k2 or k2 == k3 or k3 == k1:
                continue
            kou1 = int(str(v1) + str(v2))
            kou2 = v3
            if ans < kou1 + kou2:
                ans = kou1 + v3
print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a > b:  
    if a > c: 
        if b > c:
            num_1 = a
            num_2 = b
            num_3 = c
        else:  
            num_1 = a
            num_2 = c
            num_3 = b
    else:  
        num_1 = c
        num_2 = a
        num_3 = b
else:  
    if c > b:  
        num_1 = c
        num_2 = b
        num_3 = a
    else:  
        if a > c:  
            num_1 = b
            num_2 = a
            num_3 = c
        else:  
            num_1 = b
            num_2 = c
            num_3 = a
print(num_1*10 + num_2 + num_3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
def max(a,b,c):
 if a >= b >= c or a >= c >= b: return 10*a+b+c
 elif b >= c >= a or b >= a >= c: return 10*b+c+a
 elif c >= a >= b or c >= b >= a: return 10*c+a+b
print(max(a,b,c))

Submission status: Accepted

Solution code:
input = input().split()
input_int = [int(n) for n in input]

def bSort(a):
    for i in range(len(a)):
        for j in range(len(a)-1, i, -1):
            if a[j] < a[j-1]:
                a[j], a[j-1] = a[j-1], a[j]

    return a

numbers = bSort(input_int)

max = numbers[-1]
mid = numbers[1]
min = numbers[0]

A = str(max) + str(mid)
B = min

print(int(A)+B)

Submission status: Accepted

Solution code:
abc_list = list(map(int,input().split()))
sortlist = sorted(abc_list)
print(sortlist[-1]*10 + sortlist[-2] + sortlist[-3])

Submission status: Accepted

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

print(abc[-1]* 10 + abc[0] + abc[1])

Submission status: Accepted

Solution code:
def main():
	A, B, C = [int(_) for _ in input().split()]

	l_max=max(A,B,C)
	l_min=min(A,B,C)
	l_mid=(A+B+C)-(l_max+l_min)

	ans=10*l_max+l_mid+l_min
	print(ans)
    
main()

Submission status: Accepted

Solution code:
from sys import stdin
xs = [int(x) for x in stdin.readline().rstrip().split()]
a = xs[0] * 10 + xs[1] + xs[2]
b = xs[0] + xs[1] * 10 + xs[2]
c = xs[0] + xs[1] + xs[2] * 10
print(max(max(a, b),c))

Submission status: Accepted

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

a.sort(reverse=True)


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

Submission status: Accepted

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

print(A[0]+A[1]+A[2]*10)

Submission status: Accepted

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

x.sort()

m= x[2]*10+ x[1]+x[0]

print(m)

Submission status: Accepted

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