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: Wrong Answer

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

t = sorted([A, B, C])
print(t[0] * 10 + t[1] + t[2])

Submission status: Wrong Answer

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

t = sorted([A, B, C])
print(A * 10 + B + C)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = input().split()
ls = [int(A+B)+int(C),int(A)+int(B+C),int(B)+int(A+C)]
print(max(ls))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input().split()
a.sort(reverse=True)
if len(set(a))==1:
  print(12*a[0])
else:
  ans=int(a[0]+a[1])+int(a[2]) 
  print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans1 = int(a) + int(b+c)
ans2 = int(a+b) + int(c)
ans = max(ans1,ans2)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [input() for _ in range(n)]

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
ans = 0
if(A>B and A>C):
    ans = max(A*10+B+C,ans)
if(B>A and B>C):
    ans = max(B*10+A+C,ans)
else:
    ans = max(C*10+A+B,ans)
print(str(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

d = a+b
e = int(d)

f = b+c
g = int(f)


dic = []
dic.append(e+int(c))
dic.append(int(a)+g)
print(max(dic))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = max(A+int(str(B) + str(C)),int(str(A) + str(B))+C)
print(ans)

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = map(int, raw_input().split(' '))
print sum(s) + 10 *max(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=list(map(int,input().split()))
l.sort(reverse=True)
ans=l[0]*9+sum(l)

Submission status: Wrong Answer

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

num.sort()

print(num)

e = (num[2]*10) + num[1] +num[0] 

print(e)

Submission status: Wrong Answer

Solution code:
A, B, C = input().split()
ans1 = int(A+B) + int(C)
ans2 = int(A) + int(B+C)

print(max(ans1, ans2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(str(B)+str(C)) + A)

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

AB = A * 10 + B
BC = B * 10 + C
CA = C * 10 + A

if AB > (BC and CA):
    print(AB + C)
elif BC > (AB and CA):
    print(BC + A)
else:
    print(CA + B)

Submission status: Wrong Answer

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

AB = A * 10 + B
BC = B * 10 + C

if AB <= BC:
    print(BC + A)
else:
    print(AB + C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
abc=list(map(int,input().split()))
abc.sort(reverse=True)
print(sum(abc[:2])+abc[2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# check
ABC.sort()
X = 10 * ABC[0] + ABC[1]
Y = ABC[2]
print(X + Y)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s = "".join(input().split())
print(max(int(s[0])+int(s[1:]),int(s[-1])+int(s[:2])))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(max(result1, result2))

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def LI(): return list(map(int, input().split()))


A,B,C = LI()
print(max([A,B,C])*10+B+C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC110A

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A=''.join(input().split())
ans=0

for i in range(1, len(A)):
    ans=max(ans, eval(A[:i]+'+'+A[i:]))
    
print(ans)

Submission status: Wrong Answer

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

print(int(A+B)+int(C))

Submission status: Wrong Answer

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

print(max(a,b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(10 * c + b + a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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)
else: print(c*10+a+b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(anli[2] * 10 + anli[1] +anli[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

if a > b and a > c :
    s = str(a)+str(b)
    total = int(s)+c
    print(total)

elif b > a and b > c:
    s = str(b)+str(a)
    total = int(s)+c
    print(total) 

elif c > a and c > b:
    s = str(c)+str(a)
    total = int(s)+b
    print(total)

Submission status: Wrong Answer

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

num.sort()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(10*a+b+c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
lst = list(map(int, input().split()))
ans = 0

max_ = -1
argmax = None
for i in range(3):
    if lst[i] > max_:
        max_ = lst[i]
        argmax = i

lst.pop(i)
ans = int(str(max_) + '0')
for l in lst:
    ans += l
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
A,B,C=input().split()
max=int(A)+int(B+C)
if int(C)+int(A+B)>max:
    max=int(C)+int(A+B)
    
print(max)

Submission status: Wrong Answer

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

a.sort(reverse=True)

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

Submission status: Wrong Answer

Solution code:
v = input().split(' ')
a = v[0]
b = v[1]
c = v[2]
d = int(a + b) + int(c)
e = int(a) + int(b + c)
print(max(d, e))

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
D = int(str(A) + str(B)) + C
E = A + int(str(B) + str(C))
print(max(D, E))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(eval('+'.join(sorted(input()))+'+10'))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = input().split()
m = max(eval(A+B+"+"+C),eval(A+"+"+B+C))
print(m)

Submission status: Wrong Answer

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

a,b,t = map(int,input().split(' '))
M = max(a,b,t)*10
m = min(a,b,t)
print(min(a,b,t)+max(a,b,t)*10+a+b+t-M-m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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)
else:
    print(c*10+a+b)

Submission status: Wrong Answer

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

print(max(int(A+B) + int(C), int(B+C) + int(A), int(A+C) + int(B)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
if A==max(A,B,C):
    print(A*10+B+C)
elif B==max(A,B,C):
    print(B*10+A+C)
if C==max(A,B,C):
    print(C*10+B+A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = input().split()
x = int(a+b) + int(c)
y = int(a) + int(b+c)
z = int(a+c) + int(b)
print(max(x, max(y, z)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input().split()
ans = 0
for i in range(1, 3):
    expr = s[:]
    expr.insert(i, "+")
    expr = "".join(expr)
    ans = max(ans, eval(expr))
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# ABC110a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

a, b, c = input()[:-1].split()
print(max(int(a+b)+int(c), int(a)+int(b+c)))

Submission status: Wrong Answer

Solution code:
A = int()
B = int()
C = int()

if A == max(A, B, C):
    x = 10*A + B + C
    print("お小遣いは", x)
elif B == max(A, B, C):
    x = A + 10*B + C
    print("お小遣いは", x)
elif C == max(A, B, C):
    x = A + B + 10*C
    print("お小遣いは", x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ss = sorted(s)
print(s[-1]*10+s[-2]+s[-3])

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
TTL=A+B+C
l=[A,B,C]
l.sort
ans=TTL+l[2]*9
print(ans)

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
TTL=A+B+C
l=[A,B,C]
l.sort
ans=TTL+l[0]*9
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
S = list(input().split())
S.sort(reverse=True)
a = int("".join(S[:1]))
b = int(S[2])
print(a+b)

Submission status: Wrong Answer

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

s = a + int(str(b)+str(c))
t = c + int(str(b)+str(a))
u = b + int(str(c)+str(a))

print(max(s,t,u))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A,B,C=map(str,input().split())
a = int(A+B)+int(C)
b = int(A)+int(B+C)
c = int(B)+int(A+C)
print(max(a,b,c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

buf.sort

print(max(buf)*10+buf[1]+buf[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
print(sum([A, B, C]) - min([A, B, C]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def func():
    A, B, C = map(str, input().split())
    cand1 = int(A + B) + int(C)
    cand2 = int(B + C) + int(A)
    print(max(cand1, cand2))


if __name__ == '__main__':
    func()

Submission status: Wrong Answer

Solution code:
n = sorted( list( map(int, "1 5 2".split() ) ))[::-1]
x = int( str(n[0])+str(n[1]) ) + n[2]
print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a*10+b+c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

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

Submission status: Wrong Answer

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