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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(input().split())
l.sort()
ans = int(l[-1] + l[-2]) + int(l[-3])
print(ans)

Submission status: Accepted

Solution code:
import functools
import math

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


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


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


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


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

Submission status: Accepted

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

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())
nlist = [a, b, c]

if nlist.count(a) == 3:
    a = str(a)
    fst = a + a
    print(int(fst) + int(a))
else:
    maxn = max(nlist)
    minn = min(nlist)

    if nlist.count(maxn) > 1:
        maxn = str(maxn)
        fst = maxn + maxn
        print(int(fst) + minn)
    elif nlist.count(minn) > 1:
        minn = str(minn)
        maxn = str(maxn)
        fst = maxn + minn
        print(int(fst) + int(minn))
    else:
       nlist.pop(nlist.index(maxn))
       nlist.pop(nlist.index(minn))
       fst = str(maxn) + str(nlist[0])
       print(int(fst) + minn)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC110A - Maximize the Formula
data = sorted(list(map(int, input().rstrip().split())))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    a = list(map(int, input().split()))
    if a[0] == max(a):
        print((a[0] * 10 + a[1] + a[2]))
    elif a[1] == max(a):
        print((a[1] * 10 + a[0] + a[2]))
    else:
        print((a[2] * 10 + a[1] + a[0]))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    a,b,c = LI()
    print(9*max(a,b,c)+a+b+c)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#I
def I_():
    return

#J
def J():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

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

list = [a,b,c]
max_fig = max(list)
max_result = max_fig*10 + sum(list) - max_fig

print(max_result)

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

Submission status: Accepted

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


def solve(A: int, B: int, C: int):
    a = sorted([A, B, C])
    print(a[2]*10+a[1]+a[0])
    return


# Generated by 1.1.3 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

a.sort()

b, c, d = a

print(d * 10 + c + b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#110 A
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:
numbers = input().split()
numbers.sort()
a = int(numbers[2])
b = int(numbers[1])
c = int(numbers[0])
print(a*10+b+c)

Submission status: Accepted

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

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

print(a*10 + b + c)

Submission status: Accepted

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

if a>=b and a>=c :
    print(int(str(a)+str(b))+int(c))
elif b>=a and b>=c :
    print(int(str(b)+str(a))+int(c))
elif c>=a and c>=b :
    print(int(str(c)+str(a))+int(b))
else:
    pass

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left

def main():
	A, B, C = map(int, input().split(" "))
	
	ans = 0;
	aa = max(A, B, C)
	ans += aa * 10
	
	print(ans + A + B + C - max(A, B, C))
		
	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

if B < C:
    tmp = B
    B = C
    C = tmp
if A < B:
    tmp = A
    A = B
    B = tmp
print((A * 10) + B + C)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import math

a = list(map(int, input().split()))
a = sorted(a, key=lambda x: -x)
print(a[0]*10 + sum(a[1:]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = input().split()
l = sorted([A, B, C], reverse=True)
print(int(l[0] + l[1]) + int(l[-1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
num = []
num.append(a)
num.append(b)
num.append(c)
ookii = num.copy()
ooi = max(ookii)
num.remove(max(num))
print(ooi * 10 + num[0] + num[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ABC = sorted(ABC, reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

if a>=b:
  if a>=c:
    x=a
    if b>=c:
      y=b
      z=c
    else:
        y=c
        z=b
  else:
      x=c
      y=a
      z=b
else:
  if b>=c:
    x=b
    if a>=c:
      y=a
      z=c
    else:
        y=c
        z=a
  else:
      x=c
      y=b
      z=a

n=x*10+y+z
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list_str = input().split()
list=[int(n) for n in list_str]
list.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a = [int(i) for i in input().split()]
a.sort(reverse=1)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x.sort()

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

Submission status: Accepted

Solution code:
A, B, C = list(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: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
lis = input().split()
lis = sorted(lis, key=lambda x: int(x), reverse=True)
print(int(''.join(lis[:2])) + int(lis[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))  #リスト入力

from itertools import permutations, combinations,combinations_with_replacement,product
#a=[2,4,7]
c = list(permutations(a))

i = c[0]
first = int(str(i[0])+str(i[1]))
#print(first)
x = first+i[2]
#print(x)

maxnum = 0
for i in c:
    first = int(str(i[0])+str(i[1]))
    after = i[2]
    x = first + after

    if x > maxnum:
        maxnum = x

print(maxnum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = []

ans.append(10*a+b+c)
ans.append(10*b+c+a)
ans.append(10*c+a+b)

print(max(ans))

Submission status: Accepted

Solution code:
a=list(input().split())
a.sort()
aa=a[::-1]
b=aa.pop()
c="".join(aa)
print(int(b)+int(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=list(int(i) for i in input().split())
print(max(L)*10+sum(L)-max(L))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cards.sort(reverse = True)
ans = cards[0]*10 + cards[1] + cards[2]

print(ans)

Submission status: Accepted

Solution code:
a,b,c = input().split()
print(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)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007
sys.setrecursionlimit(1000000)

#A
def A():
    s = LI()
    s.sort(reverse = True)
    print(10*s[0]+s[1]+s[2])
    return

#B
def B():
    return

#C
def C():
    s = S()
    t = S()
    n = len(s)
    d = defaultdict(list)
    for i in range(n):
        d[s[i]].append(t[i])
    d2 = defaultdict(list)
    for i in range(n):
        d2[t[i]].append(s[i])
    for i in d.keys():
        k = d[i]
        k = list(set(d[i]))
        if len(k) > 1:
            print("No")
            quit()
    for i in d2.keys():
        k = d2[i]
        k = list(set(d2[i]))
        if len(k) > 1:
            print("No")
            quit()
    print("Yes")
#D
def D():
    n,m = LI()
    if m == 1:
        print(1)
        quit()
    d = defaultdict(int)
    i = 2
    a = m
    while i**2 <= m:
        if not a%i:
            while not a%i:
                a//=i
                d[i] += 1
        i += 1
    if a != 1:
        d[a] += 1
    fact = [1 for i in range(n+31)]
    for i in range(n+30):
        fact[i+1] = fact[i]*(i+1)%mod
    inv_fact = [None for i in range(n+31)]
    inv_fact[n+30] = pow(fact[n+30],mod-2,mod)
    for i in range(n+30)[::-1]:
        inv_fact[i] = inv_fact[i+1]*(i+1)%mod
    ans = 1
    for i in d.values():
        ans *= fact[i+n-1]*inv_fact[i]*inv_fact[n-1]%mod
        ans %= mod
    print(ans)
#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

output=[]
output.append(A+B*10+C)
output.append(A+C*10+B)
output.append(B+A*10+C)
output.append(B+C*10+A)
output.append(C+A*10+B)
output.append(C+B*10+A)

print(np.max(np.array(output)))

Submission status: Accepted

Solution code:
a=input();print(eval('+'.join(a+max(a)*9)))

Submission status: Accepted

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

Submission status: Accepted

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

a, b, c = map(int,input().split())
abc = [a,b,c]
abc.sort()
abc.reverse()
print(abc[0]*10+abc[1]+abc[2])

Submission status: Accepted

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

print(a + b + c * 10)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = [int(i) for i in input().split()]
num.sort()
print(sum(num)+num[-1]*9)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = [int(x) for x in input().split()]
N.sort()
print(sum(N) + N[-1] * 9)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

l.sort(reverse=True)

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

Submission status: Accepted

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

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

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:
a, b, c = map(int, raw_input().split())
big = a
go = b
if big < b:
    big = b
if big < c:
    big = c

if big == b:
    go = a + c
elif big == c:
    go = b + a
else:
    go = b + c
print big * 10 + go

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
a = sorted(a)
ans = a[-1]*9+sum(a)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_in = list(map(int, input().split(' ')))
_in = sorted(_in)
a = int('{}{}'.format(_in[-1], _in[-2]))
print('{}'.format(_in[0] + a))

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))  # リスト入力（数値）  map関数はリストの各要素に対して関数を適用してくれる

ans = l.pop(l.index(max(l)))*10
ans += sum(l)

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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:
import itertools

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

 
list=[]
list.append(A*10+B+C)
list.append(A*10+C+B)
list.append(B*10+A+C)
list.append(B*10+C+A)
list.append(C*10+A+B)
list.append(C*10+B+A)

list.append(A+B*10+C)
list.append(A+C*10+B)
list.append(B+A*10+C)
list.append(B+C*10+A)
list.append(C+A*10+B)
list.append(C+B*10+A)


print(max(list))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

nums.sort(reverse=True)

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

Submission status: Accepted

Solution code:
print(eval("{}{}+{}".format(*sorted(input().split())[::-1])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc=input().split()
a=int(abc[0]);b=int(abc[1]);c=int(abc[2])
abc=[a,b,c]
mx=max(abc)*10
abc.remove(max(abc))
print(str(abc[0]+abc[1]+mx))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
i.sort(reverse=True)
A = i[0]
B = i[1]
C = i[2]

AB = str(A) + str(B)
D = int(AB) + C

print(D)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a=input().split(" ")
a.sort()
print(int(a[2])*10+int(a[1])+int(a[0]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

max_a = max(a)
a[a.index(max(a))] = 0

print(max_a*10 + sum(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a<b:
	temp=b
	b=a
	a=temp
if a<c:
	temp=c
	c=a
	a=temp

print(10*a+b+c)

Submission status: Accepted

Solution code:
tmp = [int(i) for i in raw_input().split()]
A = max(tmp)
tmp.remove(A)
B = max(tmp)
tmp.remove(B)
C = max(tmp)

print(10*A + B + C)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
ab = 10*a+b+c
ac = 10*a+c+b
ba = 10*b+a+c
bc = 10*b+c+a
ca = 10*c+a+b
cb = 10*c+b+a
lists = [ab,ac,ba,bc,ca,cb]
print(max(lists))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = sorted([int(_) for _ in input().split()],reverse = True)
ans = n[0] * 10 + n[1] + n[2]
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:
list = list(input().split())
list.sort(reverse=True)
print(int(list[0] + list[1]) + int(list[2]))

Submission status: Accepted

Solution code:
def main():
    inputs = sorted(input().split())
    fst = inputs[-1]
    lst = inputs[0]
    mid = inputs[1]

    print(eval('{}{} + {}'.format(fst, mid, lst)))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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