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:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

a,b,c=rl()

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
li = [A, B, C]
li.sort()
li.reverse()
print(int(str(li[0])+str(li[1])) + li[2])

Submission status: Accepted

Solution code:
def maximize_the_formula(A: int, B: int, C: int) -> int:
    x, y, z = sorted([A, B, C], reverse=True)
    return 10 * x + y + z


if __name__ == "__main__":
    A, B, C = map(int, input().split())
    ans = maximize_the_formula(A, B, C)
    print(ans)

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:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

A, B, C = map(int, input().split())
L = [A, B, C]
L.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(l))

Submission status: Accepted

Solution code:
A = input().split()
A.sort()
B = int(A[2] + A[1])
B += int(A[0])
print(B)

Submission status: Accepted

Solution code:
lst = list(map(int, input().split()))
print(max(lst)*10+sum(lst)-max(lst))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]
ls = sorted([A, B, C])
print(int(str(ls[-1]) + str(ls[-2])) + ls[0])

Submission status: Accepted

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

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

print(ans)
print()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc110/tasks/abc110_a
a, b, c = [int(x) for x in input().split()]
li = sorted([a, b, c])
print(li[-1] * 10 + li[0] + li[1])

Submission status: Accepted

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

AB = max(int(A+B),int(B+A))
AC = max(int(A+C),int(C+A))
BC = max(int(B+C),int(C+B))
A,B,C = map(int,[A,B,C])
print(max([A+BC,B+AC,C+AB]))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

# coding: utf-8

# In[16]:


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


# In[17]:


abc = sorted([A,B,C], reverse=True)


# In[18]:


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

Submission status: Accepted

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

Submission status: Accepted

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

ret = max(a,b,c)
if ret==a:
    ans = 10*a+b+c
elif ret==b:
    ans = 10*b+a+c
elif ret==c:
    ans = 10*c+b+a
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    a = sorted(map(int, string.split()))
    return str(a[-1] * 10 + a[1] + a[0])


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

Submission status: Accepted

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

nmax = max(n)
n.remove(nmax)
ans = nmax * 10 + sum(n) 
print(ans)

Submission status: Accepted

Solution code:
import itertools, copy

n = input().split()

ans = 0
for p0, p1 in itertools.permutations(n, 2):
    n_ = copy.copy(n)
    n_.remove(p0)
    n_.remove(p1)
    
    total = int(''.join([p0, p1])) + int(n_[0])
    ans = max(ans, total)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

List = []
List.append(A)
List.append(B)
List.append(C)

big_digit = str(max(List))
del List[List.index(max(List))]

small_digit = str(List[0])

num = big_digit + small_digit
num = int(num)

print(num + List[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = str(max(l)) + str(min(l))
x = int(x)

l.remove(max(l))
l.remove(min(l))
y = int(l.pop(0))

print(x+y)

Submission status: Accepted

Solution code:
from sys import stdin

a, b, c = sorted([int(x) for x in stdin.readline().rstrip().split()], reverse=True)
print(a*10+b+c)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(sorted(input().split()))[::-1];a.insert(2,"+");print(eval("".join(a)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
a, b, c = [int(i) for i in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

a = int(str(n[0]) + str(n[1]))

print(a+n[2],end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc110/tasks/abc110_a

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

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

x = a*10+b+c
y = b*10+c+a
z = c*10+a+b

if y <= x and z <= x:
    print(x)
elif y <= z and x <= z:
    print(z)
else:
    print(y)

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
max = n.pop(n.index(max(n)))
print(max * 10 + n[0] + n[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
print(max(x,y,z) * 10 + x + y + z - max(x,y,z))

Submission status: Accepted

Solution code:
def main() -> None:
    l = list(map(int, input().split()))
    ls = sorted(l, reverse=True)
    print(int(str(ls[0]) + str(ls[1])) + ls[2])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

l = [a,b,c]

l.sort(reverse=True)

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

Submission status: Accepted

Solution code:
values = raw_input()
values = [int(i) for i in values.split(" ")]
values = sorted(values, reverse=True)
print(int(str(values[0])+str(values[1]))+values[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

sequence.sort(reverse = True)
A = str(sequence.pop(0))
A += str(sequence.pop(0))
B = sequence.pop(0)
C = int(A) + B
print(C)

Submission status: Accepted

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

Submission status: Accepted

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

n.sort()
big = int(str(n[2])+str(n[1]))
mini = n[0]

print(big+mini)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
values = raw_input()
values = [int(i) for i in values.split(" ")]
values = sorted(values)
print(str(int(str(values[2])+str(values[1]))+values[0]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A
a = [int(i) for i in 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())
list = sorted([A, B, C], reverse=True)
s1 = list[0]
s2 = list[1]
s3 = list[2]
print(s1*10+s2+s3)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(first + second)

Submission status: Accepted

Solution code:
import sys

def main():
  input = sys.stdin.readline
  N = list(map(int, input().split()))
  N = sorted(N)
  print(N[2] * 10 + N[1] + N[0])


if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = [int(n) for n in input().split()]
nums.sort()
X = int(str(nums[2]) + str(nums[1]))
Y = nums[0]
print(X+Y)

Submission status: Accepted

Solution code:
abc = list(input().split())
abc.sort(reverse=True)
ans = int(abc[0]+abc[1])+int(abc[2])
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 = list(map(int,input().split()))
a.sort(reverse=True)
print(int(str(a[0])+str(a[1]))+a[2])

Submission status: Accepted

Solution code:
# 2019/02/06
# AtCoder Beginner Contest110 - A

# Input
abc = list(map(int,input().split()))

max = -1
min = 10
maxidx = -1
minidx = -1

# Search max
for i in range(3):
    if abc[i] > max:
        max = abc[i]
        maxidx = i

# Max * 10
abc[maxidx] = abc[maxidx]*10

# Sum
ans = 0
for i in range(3):
    ans += abc[i]

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
x = [int(x) for x in input().split()]
x.sort(reverse=True)
print(x[0] * 10 + x[1] + x[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# Luis Yoichi Morales January 2019

s= ( map(int, raw_input().split()) )
s = sorted(s, reverse=True)
print int( str(s[0]) + str(s[1]) ) + (s[2])

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,b,c = map(int,input().split())
x = [a,b,c]
x = sorted(x)
print((x[2] * 10) + x[0] + x[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

tmp = sorted([A,B,C],reverse = True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
s = list(map(int, input().split()))
ss = list(itertools.permutations(s))
ans = 0
for i in ss:
    ans = max(ans, max(i[0]*10+i[1] + i[2], i[0]+i[1]*10 + i[2]))
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b,c=map(int,input().split())
li=[]
li.append(a)
li.append(b)
li.append(c)
li.sort()
print(li[2]*10+li[1]+li[0])

Submission status: Accepted

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

sort = sorted(List)

print(sort[2] * 10 + sort[1] + sort[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:
#!/usr/bin/env python3

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

    na.sort(reverse = True)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(i)for i in input().split()]
a =max(l)
print(sum(l) +9*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:
a,b,c=[int(x) for x in input().split()]
print(max(a,b,c)*10+a+b+c-max(a,b,c))

Submission status: Accepted

Solution code:
A,B,C=(int(i) for i in input().split())
abc=sorted([A,B,C])[::-1]
print(10*abc[0]+abc[1]+abc[2])

Submission status: Accepted

Solution code:
""" AtCoder """

import sys
input = sys.stdin.readline

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

N.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=input().split()
A=max(num)
num.remove((max(num)))
B=max(num)
num.remove((max(num)))
C=max(num)
ans=int(A)*10+int(B)+int(C)
print(ans)

Submission status: Accepted

Solution code:
def main():
    abc = list(input().split())
    abc.sort(reverse=True)
    print(int(''.join(abc[:2])) + int(abc[2]))


main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
maxA = max(A)
minA = min(A)
midA = sum(A) - maxA - minA

print(maxA*10 + minA + midA)

Submission status: Accepted

Solution code:
d = sorted([i for i in map(int, str(input()).split())])
print(d[2] * 10 + sum(d[0:2]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = map(int, input().split(' '));
b = sorted(a, reverse=True)
c = (10 * b[0] + b[1]) + b[2]
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools

values = map(int, input().split())
ps = list(itertools.permutations(values))

_max = 0
for p in ps:
    num1 = p[0] + (p[1] * 10 + p[2])
    num2 = (10 * p[0] + p[1]) + p[2]
    _max = max([_max, num1, num2])
print(_max)

Submission status: Accepted

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

Submission status: Accepted

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

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:
N = list(map(int,input().split()))
A = N[0]
B = N[1]
C = N[2]
Nmax = max(A,B,C)
answer = Nmax*10 - Nmax + A + B + C
print(answer)

Submission status: Accepted

Solution code:
A, B, C = sorted(input().split(), reverse = True)
print(int(A + B) + int(C))

Submission status: Accepted

Solution code:
def main(lst):
    lst.sort()
    print(sum(lst)+9*lst[2])
lst=list(map(int,input().split()))
main(lst)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

m = max(a, b, c)

print(str(m * 10 + a + b + c -m))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

big = max([a,b,c])

print(sum([a,b,c]) + 9*big)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=sorted(input().replace(' ',''))
print(int(''.join(x[:-3:-1]))+int(x[0]))

Submission status: Accepted

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

ans = sum(li) + 9 * li[-1]

 
print(ans)

Submission status: Accepted

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

lst.sort()
A = str(lst[2]) +str(lst[1])
print(int(A)+lst[0])

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]
print(max(A,B,C)*10+(A+B+C-max(A,B,C)))

Submission status: Accepted

Solution code:
x,y,z = input().split()
x=int(x) 
y=int(y)
z=int(z)
if (x>=y and x>=z):
    print(10*x + y + z)
if (x<y and y>=z):
    print(x+10*y+z)
if (x<z and y<z):
     print(x+y+10*z)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
print(max(10*X+Y+Z, 10*Y+Z+X, 10*Z+X+Y))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = sorted([int(x) for x in input().split()])[::-1]
print((a*10+b)+c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

inputs.sort()

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

numlist.sort(reverse=True)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(a) + a[2] * 9)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    l = [int(i) for i in input().split()]
    l = sorted(l, reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(a.pop(a.index(max(a)))*10 + a.pop(a.index(max(a))) + a.pop(a.index(max(a))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
print(max([(int(i[0]) + int(i[1] + i[2])) for i in itertools.permutations(input().split())]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S=input().split()
S=sorted(S, reverse=True)
print(int(S[0]+S[1])+int(S[2]))

Submission status: Accepted

Solution code:
num = list(input().split())

num.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    a = list(map(str, input().split()))
    a.sort(reverse=True)
    print(int(a[0]+a[2]) + int(a[1]))


if __name__ == "__main__":
    main()

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:
A,B,C=map(int,input().split())
L=sorted([A,B,C])
print(int(str(L[2])+str(L[1]))+L[0])

Submission status: Accepted

Solution code:
# coding: utf8

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

if __name__ == "__main__":
    n = read_int_n()
    ans = 0
    for i in range(3):
        n[i] *= 10
        sum = 0
        for k in n:
            sum += k
        if sum > ans:
            ans = sum
        n[i] /= 10
    print(int(ans))

Submission status: Accepted

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

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:
list = list(map(str,input().split()))
list.sort(reverse=True)
A = list[0]+list[1]
B = list[2]
print(int(A)+int(B))

Submission status: Accepted

Solution code:
l = [i for i in input().split(" ")]
l.sort()
l.reverse()
print(int(''.join(l[0:2]))+int(l[2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(n) for n in input().split()]
m = max(l)
mi = l.index(m)
ans = 0
for i in range(len(l)):
    if i == mi:
        ans += l[i] * 10
    else:
        ans += l[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools

a=[i for i in input().split()]
b=list(itertools.permutations(a))
c='+'
ans=0
for i in range(len(b)):
    d=eval(b[i][0]+b[i][1]+c+b[i][2])
    if ans < d:
      ans=d
print(ans)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
f = (lambda a, b, c: 10*a+b+c)
l = [f(A, B, C), f(B, A ,C), f(C, A, B)]
print(max(l))

Submission status: Accepted

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

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:
s = raw_input()
a,b,c = map(int, s.split(" "))
l=[a,b,c]
l.sort(reverse=True)
m = l[0] * 10 + l[1] + l[2]
print m

Submission status: Accepted

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

nums = sorted(nums, reverse=True)

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

Submission status: Accepted

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

snum = sorted(num, reverse=True)

print snum[0]*10 + snum[1]+ snum[2]