Problem:


Score : 100 points

Problem Statement

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

The game is played as follows:

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

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

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

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

Constraints

All values in input are integers.

1 \leq A, B, C \leq 9

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the maximum possible amount of the allowance.

Sample Input 1

1 5 2

Sample Output 1

53

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

Sample Input 2

9 9 9

Sample Output 2

108

Sample Input 3

6 6 7

Sample Output 3

82



Sample input:
1 5 2


Sample output:
53

Submission status: Accepted

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

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:
L = list(map(int, input().split()))

L = sorted(L)[::-1]

s = '{}{}+{}'.format(L[0], L[1], L[2])
print(eval(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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(a[0] * 10 + a[1] + a[2])

Submission status: Accepted

Solution code:
li = list(map(str, input().split()))*2
ans = 0
for i in range(3):
    ans = max(ans, int(li[i]+li[i+1]) + int(li[i+2]))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations


def main():
    a,b,c = input().split()
    lst = ["+",a,b,c]
    perm = list(permutations(lst))
    mx = 0
    for p in perm:
        if p[0] == "+" or p[-1] == "+":
            continue
        mx = max(mx,eval("".join(p)))
    print(mx)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# Problem A - Maximize the Formula

# input
num_list = list(map(int,input().split()))

# initialization
num_list = sorted(num_list, reverse=True)
num_list = list(map(str, num_list))

# output
ans = eval(num_list[0] + num_list[1] + "+" + num_list[2])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

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

Submission status: Accepted

Solution code:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/A-MaximizeTheFormula.py
#
a, b, c = map(int, input().split())
if a >= b and a >= c:
    print(10 * a + b + c)
elif b >= a and b >= c:
    print(a + 10 * b + c)
else:
    print(a + b + 10 * c)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

a.sort(reverse = True)
n_a = int(a[0] + a[1])
n_b = int(a[2])
print(n_a+n_b)

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

l.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
A,B,C=map(int,input().split())
x=max((10*A)+B+C,(10*B)+A+C,(10*C)+A+B)
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations

l = input().split()

res = 0
for i in permutations(l):
    x = int(i[0])
    y = int(''.join(i[1:]))
    ans = x+y
    res=max(res,ans)
print(res)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Maximize(abc):

    abc.sort(reverse=True)

    return abc[0] * 10 + abc[1] + abc[2]

def main():
    abc = list(map(int , input().split()))
    print(Maximize(abc))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

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, B, C = map(int,input().split())
print(max(A, B, C) * 10 + A + B + C - max(A, B, C))

Submission status: Accepted

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

maxNum = max(a,max(b,c))

if maxNum == a:
    sumNumString = str(a) + str(b)
    sumNum = int(sumNumString)
    print(sumNum+c)
elif maxNum == b:
    sumNumString = str(b) + str(a)
    sumNum = int(sumNumString)
    print(sumNum+c)
else:
    sumNumString = str(c) + str(a)
    sumNum = int(sumNumString)
    print(sumNum+b)

Submission status: Accepted

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

Submission status: Accepted

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

num.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = sorted(input())
print(int(l[4]) * 10 + int(l[3]) + int(l[2]))

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

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

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:
num = list(map(int, input().split()))
num.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

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,input().split())

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

Submission status: Accepted

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

num.sort(reverse=True)

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

Submission status: Accepted

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

a.sort(reverse=True)

#print(a)

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

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

x = LI()
x.sort(reverse=1)
ans = x[0]*10 + x[1] + x[2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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

arr = [A, B, C]
arr.sort()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

lines.sort()

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  a, b, c = map(int, readline().split())
  print(max(a,b,c)*9 +a+b+c)
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# ABC 110: A – Maximize the Formula
a = sorted([int(s) for s in input().split()])
a.reverse()
print(a[0] * 10 + a[1] + a[2])

Submission status: Accepted

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

jun = [a, b, c]
ojun = sorted(jun, reverse = True)

x = 10*ojun[0] + ojun[1]
y = ojun[2]
ans = x + y

print(ans)

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  a,b,c = map(int, input().split())
  ma = a + (b*10 + c)
  ma = max(ma,(a*10+b)+c)
  ma = max(ma,(c*10+a)+b)
  ma = max(ma,(c*10+b)+a)
  ma = max(ma,(a*10+c)+b)
  ma = max(ma,(b*10+a)+c)
  print(ma)
if __name__ == '__main__':
  main()

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:
#数文字列をソートしてもint型と同様に並べることができる
List = sorted([i for i in input().split(" ")],reverse=True)

X = int("".join(List[:2]))
Y = int(List[-1])
print(X+Y)

Submission status: Accepted

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

li = [A,B,C]
li.sort(reverse = True)
ans1 = li[0]*10+li[1]
ans2 =li[2]
ans = ans1 + ans2
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

*a, = map(int, sys.stdin.readline().split())
a.sort(reverse=True)

def main():
    ans = a[0] * 10 + a[1] + a[2]
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
*I, = map(int, input().split())
I2 = I.pop(I.index(min(I)))
print(int(str(max(I))+str(min(I))) + I2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    a.sort(reverse=True)
    ans =a[0]*10 +a[1] +a[2]
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

lst = list(map(int, input().split()))
# print(lst)
lst.sort(reverse=True)
# print(lst)
ans = lst[0] * 10 + lst[1] + lst[2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if A >= B and A >= C :
	answer = A * 10 + B + C
elif B >= C :
	answer = B * 10 + A + C
else:
	answer = C * 10 + A + B

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, 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, input().split())
print(max(a * 10 + b + c, a + b * 10 + c, a + c * 10 + b))

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

l.sort(reverse=True)
x = l[0:2]
x = int("".join(x))
print(x+int(l[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(x+y)

Submission status: Accepted

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

num=str(max(a))+str(sorted(a)[-2])
print(int(num)+min(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
u = max(a,b,c)
v = min(a,b,c)

n1 = u*10 + v
n2 = a + b + c -u - v

print(n1 + n2)

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:
num = sorted(list(map(int, input().split())))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

lis = sorted(lis, reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
    a,b,c = input().split()
    mx = 0
    for i,first in enumerate([a,b,c]): #最初に一桁の数値を決める
        #print(first)
        second,third = [s for j,s in enumerate([a,b,c]) if j != i]
        if second < third:
            second,third = third,second
        if int(first) + int(second+third) > mx:
            mx = int(first) + int(second + third)
    print(mx)

main()

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
n.sort(reverse=True)
n = ''.join(map(str, n))
sushiki = n[:2] + '+' + n[2]
ans = eval(sushiki)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
nums = [int(str) for str in input().strip().split()]

max_num = nums.pop(nums.index(max(nums)))

print(max_num * 10 + sum(nums))

Submission status: Accepted

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

Submission status: Accepted

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

A.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#abc110 a
num=list(map(int,input().split()))
l=max(num)
s=min(num)
m=sum(num)-l-s
ans=int(str(l)+str(m))+s
print(ans)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
D = [A, B, C]
S = max(D)

ans = 0
l = 0
for i in range(3):
  if (D[i] == S) and (l == 0):
    ans += 10 * D[i]
    l = 1
  else:
    ans += D[i]
    
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
d = [a,b,c]
d.sort(reverse=True)
ans = ""
for i in range(2):
    ans += str(d[i])
print(int(ans) + d[-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    abc = list(map(str, sys.stdin.readline().split()))
    abc.sort(reverse=True)
    print(int(abc[0]+abc[1])+int(abc[2]))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# A - Maximize the Formula
a,b,c=list(input().split())
l=[]
l=sorted([a,b,c],reverse=True)
print(eval(l[0]+l[1]+"+"+l[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(10*c+b+a)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
D = []
D.append(A)
D.append(B)
D.append(C)
D = sorted(D,reverse=True)
E = max(int(str(D[0])+str(D[1]))+D[2],int(str(D[1])+str(D[2]))+D[0])
print(E)

Submission status: Accepted

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

Submission status: Accepted

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

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 = input().split()
list.sort(reverse=True)
a,b,c = list
A = int(a)*10 + int(b)
print( A + int(c))

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:
l=list((map(int,input().split())))
ls=sorted(l,reverse=True)
print(ls[0]*10+ls[1]+ls[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:
ABC=list(map(int,input().split(' ')))
print(max([sum(ABC) + ABC[i]*9 for i in range(3)]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
a,b,c = map(int,input().split(' '))
M = max(a,b,c)
T = a+b+c
print((T-M)+M*10)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b, c = sorted(map(str, sys.stdin.readline().split()))

    print(int("".join([c, b])) + int(a))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

l.sort(reverse = True)
ans = int(str(l[0])+str(l[1])) + l[2]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = sorted(l)[1] + sorted(l)[0]

print(sorted(l)[2]*10 + n)

Submission status: Accepted

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

Submission status: Accepted

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

ans = max(a) * 10
del a[a.index(max(a))]
ans += max(a)
print(ans + min(a))

Submission status: Accepted

Solution code:
import itertools
t = input().split()
ans = 0
for i in itertools.permutations(t, 3):
    ans = max(ans, int(i[0]+i[1])+int(i[2]))
    #print(i, i[0]+i[1],i[2])
    #print(ans)
print(ans)

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())
x = max([a,b,c])
ans = x*9 + sum([a,b,c]) 
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
args = input().split()
args.sort(reverse=True)

num1 = int(''.join(args[0:2]))
num2 = int(''.join(args[2:3]))

print(num1+num2)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=sorted(list(map(str,input().split())),reverse=True)

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=sorted(list(map(int,input().split())))

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