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:
#!/usr/bin/python
# -*- coding: utf-8 -*-

s = raw_input()
nums = [int(x) for x in s.split()]
nums = sorted(nums, reverse=True)
a, b, c = nums
print a*10+b+c

Submission status: Accepted

Solution code:
# A,B,Cの値の獲得
num = list(map(int, input().split()))
# numリストの最大値を10倍
num[num.index(max(num))] *= 10
# npで要素の和を計算し、出力
print(sum(num))

Submission status: Accepted

Solution code:
# インポート
import numpy as np
# A,B,Cの値の獲得
num = list(map(int, input().split()))
# numリストの最大値を10倍
num[num.index(max(num))] = max(num) * 10
# npで要素の和を計算し、出力
print(np.sum(num))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = sorted([x for x in input().split()], reverse=True)
print(int("".join(lst[:2])) + int(lst[2]))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = map(int, raw_input().split())
y = max(X)
print 10*y+sum(X)-y

Submission status: Accepted

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

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

if A >= B and A >= C :
    sum = A * 10 + B + C

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

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc110/tasks/abc110_a
def solve():
    low, mid, high = sorted(list(map(str, input().split())))
    print(int(high + mid) + int(low))


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

b.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = sorted(N)

Nmax = int( N[2] * 10 + N[1] + N[0])

print(int(Nmax))

Submission status: Accepted

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

Submission status: Accepted

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

s1 = 10 * a + b + c
s2 = a + 10 * b + c
s3 = a + b + 10*c

print(max(s1, s2, s3))

Submission status: Accepted

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

Submission status: Accepted

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

Nmax = N[2] + N[1]
print(int(Nmax) + int(N[0]))

Submission status: Accepted

Solution code:
def maximize_the_formula(a, b, c):
    l = sorted([a, b, c])
    return l[2] * 10 + l[1] + l[0]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# あ
numbers = [int(i) for i in input().split()]

left1 = max(numbers)
numbers.remove(left1)
left2 = max(numbers)
right = min(numbers)

left = str(left1) + str(left2)

print(int(left) + right)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def bogosort(l):
  import random
  while 1:
    random.shuffle(l)
    for i in range(1,len(l)):
      if l[i]<l[i-1]:
        break
    else:
      return l
l=input().split()
a,b,c=bogosort(l)
print(eval(c+b+'+'+a))

Submission status: Accepted

Solution code:
s=sorted(input())[::-1]
s.insert(2,'+')
print(eval(''.join(s)))

Submission status: Accepted

Solution code:
*_,a,b,c=sorted(input());print(eval(c+b+'+'+a))

Submission status: Accepted

Solution code:
*h,a,b,c=sorted(input());print(int(c+b)+int(a))

Submission status: Accepted

Solution code:
h,f,a,b,c=sorted(input());print(int(c+b)+int(a))

Submission status: Accepted

Solution code:
a,b,c=sorted(input()[::2]);print(int(c+b)+int(a))

Submission status: Accepted

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

Submission status: Accepted

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

elif max(a,b,c) == b:
    n = b*10+a+c
    print(n)

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


print(abc110_a())

Submission status: Accepted

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

nums.sort()

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

Submission status: Accepted

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

sa.sort()

ans = int(sa[2] + sa[1]) + int(sa[0])
print(ans)

Submission status: Accepted

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

sa = input().rstrip().split()
sa.sort()

ans = int(sa[0]) + int(sa[2] + sa[1])
print(ans)

Submission status: Accepted

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

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


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


main()

Submission status: Accepted

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)
else:
    if 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+a+b+c-max([a,b,c]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
i = int(str(a)+str(b))+c
i2= int(str(b)+str(a))+c
j = int(str(b)+str(c))+a
j2= int(str(c)+str(b))+a
k = int(str(c)+str(a))+b
k2= int(str(a)+str(c))+b
n = max(i,i2,j,j2,k,k2)
print(n)

Submission status: Accepted

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

ans = A + B + C + 9 * max(A, B, C)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A問題
A,B,C=input().split(' ')
#input() 入力を受け付ける
#split() 空白区切り

A=int(A)
B=int(B)
C=int(C)
numberList=[A,B,C]

numberList.sort(reverse=True)

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

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def big(a, b, c):
    if a>=b and a>=c:
        g = a
    elif b>=a and b>=c:
        g = b
    else:
        g = c

    return g


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

a, b, c = n[0], n[1], n[2]
g1, g2 = 0, 0

g1 = big(a, b, c)
if g1 == a:
    a = 0
elif g1 == b:
    b = 0
else:
    c = 0

g2 = big(a, b, c)
if g2 == a:
    a = 0
elif g2 == b:
    b = 0
else:
    c = 0

num = g1*10 + g2 + a + b + c

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = x10 * 10 + a[0] + a[1]
print(s)

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_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, raw_input().split())

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

Submission status: Accepted

Solution code:
# abc110_a


def solve(numbers):
    return max(
        int(numbers[0] + numbers[2]) + int(numbers[4]),
        int(numbers[2] + numbers[4]) + int(numbers[0]),
        int(numbers[4] + numbers[0]) + int(numbers[2]),
    )


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

Submission status: Accepted

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

A = 10*a + b + c
B = a + 10*b + c
C = a + b + 10*c

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
arr=[]
if((A>=1 and A<=9)and(B>=1 and B<=9)and(C>=1 and C<=9)):
    arr=[A,B,C]
    arr=sorted(arr, reverse=True)
    mystr=str(arr[0])+str(arr[1])
    print(int(mystr)+arr[2])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
e = [int(_) for _ in input().split()]
print(max(e) * 10 + sum(e) - max(e))

Submission status: Accepted

Solution code:
list_ = sorted(input(), reverse=True)
print(int("".join(list_[:2])) + int(list_[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = (raw_input().split())
#print(lst)

lst.sort()
lst.reverse()
lst = list(map(int, lst))
#lst = [int(x) for x in lst]
#print(lst)

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

Submission status: Accepted

Solution code:

list= [int(i) for i in input().split()] 
l=sorted(list)
l[-1]=l[-1]*10
print(sum(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
# N,M = [int(n) for n in input().split()]
# S = str(input())
# T = str(input())
a,b,c = [int(n) for n in input().split()]

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

Submission status: Accepted

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

B = A[0]+A[1]
C = A[2]
ans = int(B) + int(C)

print(ans)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
ans=[]
ans.append(a)
ans.append(b)
ans.append(c)
ans.sort(reverse=True)
temp=""
temp+=str(ans[0])
temp+=str(ans[1])
print(int(temp)+ans[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("{}".format(max))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n  = list(map(int, input().split()))
n.sort(reverse=True)
print(n[0]*10+n[1]+n[2])

Submission status: Accepted

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

Submission status: Accepted

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

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())
ans = max([A*10+B+C,A+B*10+C,A+B+C*10])
print(ans)

Submission status: Accepted

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

n.sort()

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

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

Submission status: Accepted

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

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:
x=list(map(int,input().split()))
#print(x)
x.sort()
print(int(str(x[-1])+str(x[1]))+x[0])

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def bSort(a):
    for i in range(len(a)):
        for j in range(len(a)-1, i, -1):
            if a[j] < a[j-1]:
                a[j], a[j-1] = a[j-1], a[j]

    return a

ns = input().split()
s = bSort(ns)
print(int(s[2]) * 10 + int(s[1]) + int(s[0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
X = []
Y = []
if A >= B and A >= C:
    X.append(str(A))
    if B >= C:
        X.append(str(B))
        Y.append(str(C))
    else:
        X.append(str(C))
        Y.append(str(B))

elif B >= A and B >= C:
    X.append(str(B))
    if A >= C:
        X.append(str(A))
        Y.append(str(C))
    else:
        X.append(str(C))
        Y.append(str(A))

else:
    X.append(str(C))
    if A >= B:
        X.append(str(A))
        Y.append(str(B))
    else:
        X.append(str(B))
        Y.append(str(A))
ans = int((''.join(X))) + int((''.join(Y)))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c=input().split()
matome=[a,b,c]
mx=max(a,b,c)
mn=min(a,b,c)
mex=mx+mn
ans1=int(mex)
import statistics
md=statistics.median(matome)
ans2=int(md)
print(ans1+ans2)

Submission status: Accepted

Solution code:
import numpy as np
ABC  =list(map(int, input().split()))
orders = [[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0],  [2, 0, 1], [2, 1, 0]]
max_value = 0
for order in orders:
    a, b, c = order
    max_value = max(max_value,max((ABC[a] * 10 + ABC[b]) + ABC[c], ABC[a] + (ABC[b] * 10 + ABC[c])))
print(max_value)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin

s = sorted([x for x in stdin.readline().rstrip().split()], reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
number=[]
num_m=[]
number=input().split()

num_m=number
j=0
for j in range(2):
    i=0
    for i in range(2):
        if number[i]<number[i+1]:
            tmp=number[i]
            number[i]=number[i+1]
            number[i+1]=tmp

num_m[0]=int(number[0])*10
num_m[1]=int(number[1])
num_m[2]=int(number[2])
sum=0
sum=num_m[0]+num_m[1]+num_m[2]

print(sum)
n,j=0,0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

arr=list(map(int, arr_data[0]))

arr.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = sorted([int(inp) for inp in input().split(' ')])
nums.reverse()
print(int(str(nums[0]) + str(nums[1])) + nums[2])

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
# sort()は破壊的です
# sorted()は破壊的じゃないです
l.sort(reverse=True)
print(l[0]*10 + l[1] + l[2])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = int(n[0]+n[1])+int(n[2])
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

#a = int(input())
#b = int(input())
#c = int(input())

a,b,c = [int(x) for x in stdin.readline().rstrip().split()]


ab_c = 10 * a + b + c
#ac_b = 10 * a + c + b
ba_c = 10 * b + a + c
#bc_a = 10 * b + c + a
ca_b = 10 * c + a + b
#cb_c = 10 * c + b + b

ret = max(ab_c, ba_c, ca_b)

print(ret)

Submission status: Accepted

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

abc.sort()
ans = int(str(abc[2]) + str(abc[1])) + int(abc[0])

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print((lambda x,y,z:x+y+z*10)(*sorted(map(int,input().split()))))

Submission status: Accepted

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

max = N[0]
max_index = 0

for i in range(len(N)):
    if N[i] > max:
        max = N[i]
        max_index = i

ans = N[max_index] * 10 + N[max_index - 1] + N[max_index - 2]

print(ans)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(a,b,c):
    return ((max(a,b,c,)*10)+a+b+c-max(a,b,c))

# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b, str_c] = line.split(' ')
    return (int(str_a), int(str_b), int(str_c))

def main():
    a, b, c = readQuestion()
    answer = solve(a, b, c)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(C*10 + A + B)

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

print d*9 + a + b + c

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = list(map(str, input().split()))
nline = sorted(line,reverse=True)

A = nline[0] + nline[1]
print(int(A) + int(nline[2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_list = input().rstrip().split(' ')
max_num = max(input_list)
max_index = input_list.index(max_num)

big_str = str(input_list.pop(max_index))
big_str += str(input_list.pop())
big_num = int(big_str)
other_num = int(input_list.pop())

result = big_num + other_num
print(result)

Submission status: Accepted

Solution code:
s = input()
a = int(s.split()[0])
b = int(s.split()[1])
c = int(s.split()[2])
if a >= b and a >= c:
    ans = a*10 + b+c
if b >= a and b >=c:
    ans = b*10 + c + a
if c >=a and c>=b:
    ans = c*10 + a + b
    
print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def MaxNum(n1, n2):
    if int(n1) > int(n2):
        return int(n1 + n2)
    else:
        return int(n2 + n1)

if __name__ == '__main__':
    data = input().split()
    sum = list()

    sum.append(int(data[0]) + MaxNum(data[1], data[2]))
    sum.append(int(data[1]) + MaxNum(data[0], data[2]))
    sum.append(int(data[2]) + MaxNum(data[0], data[1]))

    print(max(sum))

Submission status: Accepted

Solution code:
IN = list(map(int, input().split(" ")))
IN = sorted(IN)[::-1]
print(eval("{}{}+{}".format(*IN)))

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)
y = 10*x + (a+b+c-x)
print(y)

Submission status: Accepted

Solution code:
num = input().split(" ")
number = [int(s) for s in num]
list = sorted(number, reverse = True)
sol = 10*list[0] + list[1] + list[2]
print(sol)

Submission status: Accepted

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

ans = a + b + c + max(max(a,b),c) * 9
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
#AtCoder Beginer Contest 110 A Maximize the Formula

a = list(input().split())
a.sort(reverse=True)

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

Submission status: Accepted

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

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

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 = (int(i) for i in input().split(' '))
print(max([A,B,C])*9 + A +B+C)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
num.sort()
num.reverse()
m_ = int(str(num[0]) + str(num[1]))
_m = num[2]
sum_ = m_ + _m
print(sum_)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
list=[A,B,C]
M=max(list)
N=A+B+C
D=9*M+N
print(D)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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