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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
l=list(map(int,input().split()))
print(max(l)*10+sum(l)-max(l))

Submission status: Accepted

Solution code:
List = [_ for _ in input().split()]

sortedList = sorted(List, reverse=True)
print(int(sortedList[0]+sortedList[1]) + int(sortedList[2]))

Submission status: Accepted

Solution code:
li = input().split()
li.sort()

ans = int(li[2])*10+int(li[1])+int(li[0])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A.sort()
M = 10 * int(A[-1]) + int(A[0]) + int(A[1])
print(M)

Submission status: Accepted

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

m=max(a,b,c)

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

Submission status: Accepted

Solution code:
def return_biggest_sum(numbers):
    """入力 [int, int, int]
    """
    numbers.sort()
    numbers.reverse() # 降順に並び替え
    return int(str(numbers[0])+str(numbers[1])) + numbers[2]

line = input()
numbers_list = list(map(int, line.split()))
print(return_biggest_sum(numbers_list))

Submission status: Accepted

Solution code:
nums = [int(i)for i in input().split()]
nums = sorted(nums,reverse=True)
strnum = str(nums[0]) + str(nums[1])
x = int(strnum)
y = nums[2]
print(x+y)

Submission status: Accepted

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


new_data=sorted(data)

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

Submission status: Accepted

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

Submission status: Accepted

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

l = [A, B, C]
m = max(l)
l.remove(m)
print(m*10 + l[0] + l[1])

Submission status: Accepted

Solution code:
l = [i for i in map(int, input().split())]
l.sort()
print((l[-1]*10)+l[0]+l[1])

Submission status: Accepted

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

Submission status: Accepted

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

d = eval((a + b) + '+' + c)
e = eval((b + a) + '+' + c)
f = eval((a + c) + '+' + b)
g = eval((c + a) + '+' + b)
h = eval((b + c) + '+' + a)
i = eval((c + b) + '+' + a)

h = [d, e, f, g, h, i]

print(max(h))

Submission status: Accepted

Solution code:
string = input().split()
num = [int(x) for x in string]
max_idx = num.index(max(num))

res = 0
for x in range(len(num)):
    if x == max_idx:
        res += num[x]*10
    else:
        res += num[x]

print(res)

Submission status: Accepted

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

line = input().split( )
line = [int(s) for s in line]
a = []
a.append(line[0]* 10 + line[1] + line[2])
a.append(line[1]* 10 + line[0] + line[2])
a.append(line[2]* 10 + line[0] + line[1])
print(max(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
temp = max(a)
a.pop(a.index(max(a)))
print(int(str(temp)+str(max(a)))+min(a))

Submission status: Accepted

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

l = sorted(l)


f = 10 * int(l[2]) +  int(l[1]) + int(l[0])


print(f)

Submission status: Accepted

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

data = [A,B,C]
                 
data.sort()
                 
print(str(data[2]*10+data[1]+data[0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
panels = input().split()
panels = [int(panel) for panel in panels]
panels = sorted(panels,reverse=True)

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

Submission status: Accepted

Solution code:
C,A, B = sorted(map(int,input().split()))
if A>B:
  print(A*10 +B+C)
elif A<B:
  print(A+B*10+C)
else:
  print(A+B*10+C)

Submission status: Accepted

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

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

print(max(eval(A + '+' + B + C), eval(A + B + '+' + C), eval(B + '+' + C + A),
        eval(A + '+' + C + B), eval(B + A + '+' + C), eval(B + '+' + A + C)))

Submission status: Accepted

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

x = str(z[0]) + str(z[1])
x = int(x)
y = int(z[2])

print(x + y)

Submission status: Accepted

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

a = int(d[0])
b = int(d[1])
c = int(d[2])

e = 0

e = a*10+b+c

if e < b*10+a+c:
    e = b*10+a+c
    if e < c*10+a+b:
        e = c*10+a+b

if e < c*10+a+b:
    e= c*10+a+b
    if e < b*10+a+c:
        e = b*10+a+c

print(e)

Submission status: Accepted

Solution code:
A=list(map(int, input().split()))
for i in range(3):
	for j in range(2):
		if A[j]<A[j+1]:
			temp_A=A[j]
			A[j]=A[j+1]
			A[j+1]=temp_A
print(A[0]*10+A[1]+A[2])

Submission status: Accepted

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

Submission status: Accepted

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

p = [A, B, C]

p.sort()

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

Submission status: Accepted

Solution code:
value = []
for part in input().split():
    value.append(int(part))

value.sort()
value.reverse()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if A <= B and B <= C:
    a = A
    b = B
    c = C
elif A <= B and C <= A:
    a = C
    b = A
    c = B
elif A <= C and C <= B:
    a = A
    b = C
    c = B
elif B <= A and A <= C:
    a = B
    b = A
    c = C
elif B <= C and C <= A:
    a = B
    b = C
    c = A
else:
    a = C
    b = B
    c = A

max_num = int(str(c) + str(b)) + a

print(max_num)

Submission status: Accepted

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

A.sort()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# !/usr/bin/env python
# vim: set fileencoding=utf-8 :

"""
#
# Author:   Noname
# URL:      https://github.com/pettan0818
# License:  MIT License
# Created: 日  9/23 21:01:19 2018

# Usage
#
"""
def get_input():
    return [i for i in input().split(" ")]

def make_it(num_list):
    """
    >>> make_it(['1','5','2'])
    """
    res = list(sorted(num_list, reverse=True))
    st = res[0] + res[1]
    return int(st) + int(res[2])

if __name__ == '__main__':
    print(make_it(get_input()))

Submission status: Accepted

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

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

b = sorted(a,reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    nums = sorted([int(i) for i in input().split()], reverse=True)
    max_num = 10 * nums[0] + nums[1] + nums[2]
    print(max_num)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = (A*10+B) + C

tmp = (A*10+C) + B
if tmp > ans:
    ans = tmp

tmp = (B*10+A) + C
if tmp > ans:
    ans = tmp

tmp = (B*10+C) + A
if tmp > ans:
    ans = tmp

tmp = (C*10+B) + A
if tmp > ans:
    ans = tmp

tmp = (C*10+A) + B
if tmp > ans:
    ans = tmp

print(ans)

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())
X = [A, B , C]
Y = max(X)
X.remove(Y)
Z = Y * 10 + X[0] + X[1]
print(Z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 整数の入力
A, B, C = map(int, input().split())

tmp_max = 10*A + B + C 

if tmp_max < 10*B + C +A:
    tmp_max = 10*B + C +A

if tmp_max < 10*C + A +B:
    tmp_max = 10*C + A +B

# 出力
print("{}".format(tmp_max))

Submission status: Accepted

Solution code:

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

if max(A,B,C) == A:
    print(A*10+B+C)
elif max(A,B,C) == B:
    print(B*10+A+C)
elif max(A,B,C) == C:
    print(C*10+B+A)

Submission status: Accepted

Solution code:
data = input().split()
a = max(data)
data.remove(a)
b = max(data)
data.remove(b)
c = int(max(data))
d = str(a)+str(b)
num = int(d)
print(num+c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


def main():
    A, B, C = raw_input().split()
    a = int(A + B) + int(C)
    b = int(A + C) + int(B)
    c = int(B + A) + int(C)
    d = int(B + C) + int(A)
    e = int(C + B) + int(A)
    f = int(C + A) + int(B)
    print(max(a, b, c, d, e, f))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

abc = inpl()
abc.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

A, B, C = [int(i) for i in input().split(' ')]

print(max(A + B*10 + C, A*10 + B + C, C*10 + A + B))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 23 21:00:48 2018

@author: masato
"""

a = list(map(int, input().split()))
a.sort()
c = a[-1]
d = c*10 + a[0] + a[1]
print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
x=0
for i in A:
    x+=i
x+=max(A)*9
print(x)

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

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

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 >= C) and (B >= C):
  print((10 * B) + A + C)
else:
  print((10 * C) + B + A)

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:
a=input()
b=a.split(" ")
b=[int(x) for x in b]
b.sort()
print(int(str(b[2])+str(b[1]))+b[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=list(input().split())
X=[A,B]
D=int("".join(X))+int(C)
X=[B,A]
E=int("".join(X))+int(C)
X=[A,C]
F=int("".join(X))+int(B)
X=[C,A]
G=int("".join(X))+int(B)
X=[B,C]
H=int("".join(X))+int(A)
X=[C,B]
I=int("".join(X))+int(A)

print(max([D,E,F,G,H,I]))

Submission status: Accepted

Solution code:

ABC =  list(int(i) for i in input().split())

a1 = max(ABC)

ABC.remove(a1)

a2 = max(ABC)
a3 = min(ABC)

ans = a1*10 + a2 + a3
print(ans)

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=(int(i) for i in input().split())
print(a+b+c+max(a,b,c)*9)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
lst = [A,B,C]
lst = sorted(lst)

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

Submission status: Accepted

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

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

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:
_in = input()

nums = [int(n) for n in _in.split(" ")]
nums = sorted(nums, reverse=True)

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

Submission status: Accepted

Solution code:
A,B,C=[int(i) for i in input().split()]
list=[]
list.append(A)
list.append(B)
list.append(C)
max=max(list)
list.remove(max)

print(10*max+sum(list))

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 >= C):
  print(10*B + C + A)
  
else:
  print(10*C + A + B)

Submission status: Accepted

Solution code:
l = [int(_) for _ in input().split()]
l.sort(reverse=True)

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

Submission status: Accepted

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

print(a + b + c*10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

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

i = np.argmax([a, b, c])
l = [a, b, c]
m = l[i]
l.pop(i)
print(m*10 + l[0] + l[1])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations

maxi = -1

for a, b, c in permutations(input().split()):
    abPc = int(a + b) + int(c)
    maxi = max(maxi, abPc)

print(maxi)

Submission status: Accepted

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

result=L[0]*10+L[1]+L[2]

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(max(a)*10-max(a)+sum(a))

Submission status: Accepted

Solution code:
abc = list(map(int,input().split()))
abc.sort(reverse=True)
abc = [str(i) for i in abc]
num_1 = int(abc[0] + abc[1])
num_2 = int(abc[2])
print(num_1 + num_2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B, C = map(int, input().split())

ls =[A,B,C]

ls.sort()
print(ls[2]*10+ls[1]+ls[0])

Submission status: Accepted

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

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

mx = max(list)

ans = mx * 10

for i in range(3):
  ans += list[i]

ans = ans - mx

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ab=a*10+b
ba=b*10+a

bc=b*10+c
cb=c*1-+b

ca=c*10+a
ac=a*10+c

ans=max(ab+c,ba+c,bc+a,cb+a,ca+b,ac+b)

print ans

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
#a = int(input())
# スペース区切りの整数の入力
a, b, c = map(int, input().split())
# 文字列の入力
#s = input()
# 出力
d = max(a,b,c)
if a==d:
    a*=10
elif b==d:
    b*=10
elif c==d:
    c*=10
print("{}".format(a+b+c))
#print("{} {}".format(a+b+c, s))

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if A>B:
	if A>C:
		print(10*A+B+C)
	else:
		print(10*C+A+B)
elif B>C:
	print(10*B+A+C)
else:
	print(10*C+A+B)

Submission status: Accepted

Solution code:
res = sorted([int(x) for x in input().split()], reverse=True)
print(res[0] * 10 + res[1] + res[2])

Submission status: Accepted

Solution code:
import itertools
A,B,C=map(int,input().split())
L=[str(A),str(B),str(C),"+"]
S=list(itertools.permutations(L,4))
ans=0
for seq in S:
    if seq[0]=="+" or seq[3]=="+":
        continue
    eq="".join(seq)
    tmp=eval(eq)
    if ans<tmp:
        ans=tmp
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

a = int(A)
b = int(B)
c = int(C)

num = []
num.append(a)
num.append(b)
num.append(c)
num.sort()
print(num[2]*10+num[1]+num[0])

Submission status: Accepted

Solution code:
input_list = [int(elem) for elem in input().split(' ')]
input_list.sort()
answer = input_list[2] * 10 + input_list[1] + input_list[0]
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Max=max(A)
Min=min(A)
A.remove(Max)
A.remove(Min)

print(10*Max+Min+A[0])

Submission status: Accepted

Solution code:
#encoding utf-8
num = list(int(i) for i in input().split())

num.sort(reverse=True)

max = int(str(num[0])+str(num[1]))+num[2]

print(max)

Submission status: Accepted

Solution code:
numlist = list(map(int, input().split(' ')))
numlist.sort(reverse=True)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

panel.sort()
panel.reverse()

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

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
maxim = max(abc)
abc.remove(maxim)
second = max(abc)
abc.remove(second)
third = max(abc)

print(maxim*10+second+third)

Submission status: Accepted

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

Submission status: Accepted

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

arr.sort(reverse=True)

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

Submission status: Accepted

Solution code:
# coding: utf-8


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

    maxnum = max(li)
    li.remove(max(li))

    li.append(maxnum * 10)
    print(sum(li))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

num = []
num.append(int(A))
num.append(int(B))
num.append(int(C))

num.sort(reverse=True)
big = str(num[0]) + str(num[1])
print(int(big) + num[2])

Submission status: Accepted

Solution code:
def getValue(A, B, C, List):
  D=A+B
  Sum=int(D)+int(C)
  List.append(Sum)
  return List
  
A, B, C=input().split()

List=[]
List=getValue(A, B, C, List)
List=getValue(A, C, B, List)
List=getValue(B, A, C, List)
List=getValue(B, C, A, List)
List=getValue(C, B, A, List)
List=getValue(C, A, B, List)

print(max(List))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

sortedNum = sorted(num)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = input().split()
#ABC
#ABC
#BAC
#BCA 
#CAB
#CBA 
print(max(int(A+B)+int(C), int(A+C)+int(B), int(B+A)+int(C), int(B+C)+int(A), int(C+A)+int(B),int(C+B)+int(A)))

Submission status: Accepted

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

input = sys.stdin.readline
a = input().split()

a.sort()
a.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ns.sort()
ns.reverse()

sum = ns[0] * 10 + ns[1] + ns[2]

print(sum)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

nums = [int(s) for s in input().split(" ")]
nums.sort(reverse=True)
print(nums[0] * 10 + nums[1] + nums[2])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


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


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


def read_float():
    return float(input())


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


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, A):
    ans = 0
    return ans


def main():
    A, B, C = read_int_n()
    ans = max(A, B, C) * 10 + A + B + C - max(A, B, C)

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

if A >= B:
    if A >= C:
        print(A * 10 + B + C)
    else:
        print(C * 10 + B + A)
else:
    if B >= C:
        print(B * 10 + A + C)
    else:
        print(C * 10 + B + A)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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(B*10+A+C)
    else:
        print(C*10+A+B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(str(inputs[0] + (inputs[2] * 10 +  inputs[1])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=  map(int,input().split())
temp= [a,b,c]
temp.sort()
temp1=int(str(temp[-1])+str(temp[-2]))
print(temp1+temp[0])

Submission status: Accepted

Solution code:
ai = lambda: list(map(int,input().split()))
ai_ = lambda: [int(x)-1 for x in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

print((A+B+C)+max(A,B,C)*9)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

Solution code:
import sys

def input2():
    return tuple(int(x) for x in input().split(" "))

def main(n):
    n.sort(reverse=True)
    print(n[0] * 10 + n[1] + n[2])

if __name__ == "__main__":
    main(list(input2()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

m = 0
for i in range(3):
    tmp = a[i] * 10 + sum(a) - a[i]
    if m < tmp:
        m = tmp
        
print(m)

Submission status: Accepted

Solution code:
abc = list(map(int, input().split(' ')))
maxV = max(abc)
abc.remove(maxV)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    arry = list(map(int, input().split()))
    arry.sort(reverse=True)
    print(10 * arry[0] + arry[1] + arry[2]) 
    


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(10*c+b+a)

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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

M = max(A,B,C)

print(A+B+C+9*M)

Submission status: Accepted

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

z=sorted(list(a))
print(z[2]*10+z[1]+z[0])

Submission status: Accepted

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

x.sort()
x.reverse()

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

Submission status: Accepted

Solution code:
a = sorted(list( map(int, input().split()) ))	# 1 2 3 4 5 ...(ソート付き)

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

print(ans)

Submission status: Accepted

Solution code:

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

a.sort()

b = a[-1]*10 + a[-2]
c = a[0]

print(b+c)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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