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:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

I = list(map(int, input().split()))
I.sort(reverse=True)
print(I[0] * 10 + sum(I[1:3]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arrtemp = []

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

print(max(arrtemp)*10+sorted(arrtemp)[1]+min(arrtemp))

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

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

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:
s = list(input().split())
s = sorted(s,reverse = True)
print(int(''.join(s[:2]))+int(s[2]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

a=sorted(a,reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
import copy

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

    return 0

if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

num = Ss()
num.sort(reverse=True)
ans = int("".join(num[:2])) + int(num[-1])
print(ans)

Submission status: Accepted

Solution code:
num_list = list(map(int,input().split()))
max_num = max(num_list)
f_max = 0
sum_result = 0
for i in num_list:
	if i == max_num and f_max == 0:
		sum_result = sum_result + 10 * i
		f_max = 1
	else:
		sum_result = sum_result + i
		
print(sum_result)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = sorted(map(int, input().split()))
print(L.pop() * 10 + sum(L))

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:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

A = iil()
A.sort()

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B,C = inputIL()

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

Submission status: Accepted

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

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:
inf = 10**15
mod = 10**9+7
a,b,c = map(int, input().split())
ans = max(a*10+b+c, b*10+a+c, c*10+b+a)
print(ans)

Submission status: Accepted

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

m = max(values)
values.remove(m)

print(10 * m + sum(values))

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

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())
print(a + b + c + max(a, b, c)*9)

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=sorted(list(map(int,input().split())))
a[2]*=10
print(sum(a))

Submission status: Accepted

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

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    L.sort(reverse=True)
    print(L[0] * 10 + L[1] + L[2])



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_110_A()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A = lr()
A.sort()
answer = sum(A) + 9 * max(A)
print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

print(max_value)

Submission status: Accepted

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


A = LI()

A.sort(reverse=True)
print(int(A[0] +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, input().split())
ans = []
ans.append(10* a + b + c)
ans.append(10* a + c + b)
ans.append(10* b+ a + c)
ans.append(10* b + c + a)
ans.append(10* c + a + b)
ans.append(10* c + b + a)
print(max(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l.sort(reverse=True)
print(l[0]*10+l[1]+l[2])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
ABC=[x for x in input().rstrip().split()]
ABC.sort(reverse=True)
ab=ABC[0]+ABC[1]
c=ABC[2]
print(int(ab)+int(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:
a, b, c = map(int, input().split())
print(max(a + (b*10+c), (a*10+b) + c,
a + (c*10+b), (a*10+c) + b,
b + (a*10+c), (b*10+a) + c,
b + (c*10+a), (b*10+c) + a,
c + (a*10+b), (c*10+a) + b,
c + (b*10+a), (c*10+b) + a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
l = sorted(list(input().split()))
print(int(l[2] + l[1]) + int(l[0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=''.join(sorted(input().split())[::-1])
print(eval(A[:2]+'+'+A[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().split()))
l.sort()
print(int(str(l[2])+str(l[1]))+l[0])

Submission status: Accepted

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

Submission status: Accepted

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


def solve(A: int, B: int, C: int):
    m = 0
    for n1, n2, n3 in permutations([A, B, C]):
        exp1 = "%d+%d%d" % (n1, n2, n3)
        exp2 = "%d%d+%d" % (n1, n2, n3)
        m = max(m, eval(exp1), eval(exp2))
    print(m)


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 = (input().split())
game = [a,b,c]
s_game = sorted(game , reverse =True)
# print(s_game)
ans1 = s_game[0]+ s_game[1]
# print(ans1)
ans = int(ans1) + int(s_game[2])
print(ans)

Submission status: Accepted

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

l=[a,b,c]

l.sort()

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

Submission status: Accepted

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

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:
A,B,C=sorted(input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
L=[a,b,c]
L.sort()
print(L[2]*10+L[1]+L[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

a = sorted(a, reverse=True)

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

Submission status: Accepted

Solution code:
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

x = A * 10 + B + C
y = A + 10 * B + C
z = A + B + 10 * C
print(max(x, y, z))

Submission status: Accepted

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

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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()
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())

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

Submission status: Accepted

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

l = [A, B, C]

num = str(l.pop(l.index(max(l)))) + str(l.pop(l.index(max(l))))

print(int(num) + max(l))

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    number = sorted([A, B, C], reverse = True)
    print(int(10*number[0] + number[1] + number[2]))
if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

elif max < int(c+a) + int(b):
    max = int(c+a) + int(b)
print(max)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
s = input().rstrip().split(' ')
s.sort(reverse=True)
money = (10*int(s[0])+int(s[1])) + int(s[2])
print(money)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = sum([A,B,C])+max([A,B,C])*9
print(ans)

Submission status: Accepted

Solution code:
import sys

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


if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Accepted

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

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

desc = sorted([A,B,C], reverse=True)
print(desc[0]*10 + desc[1]+desc[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:
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:
S=list(map(int,input().split()))
AS=sorted(S)
print(int(str(AS[2])+str(AS[1]))+int(AS[0]))