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
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

a, b, c = na()

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

Submission status: Accepted

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

#----------
A,B,C = input().rstrip().split()
#----------
temp_list=[]
temp_list += [int(A) + int(B+C)]
temp_list += [int(A) + int(C+B)]
temp_list += [int(B) + int(A+C)]
temp_list += [int(B) + int(C+A)]
temp_list += [int(C) + int(A+B)]
temp_list += [int(C) + int(B+A)]

print(max(temp_list))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, A: int, B: int, C: int) -> str:

        s = sorted([A, B, C])

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


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(A, B, C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#110_A
X=sorted(list(map(int,input().split())))
print(X[-1]*10+X[0]+X[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) - min(A, B, C)) + min(A, B, C))

Submission status: Accepted

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

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

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 = list(map(int, input().split()))
m = max(A)
A.remove(m)
print(m * 10 + A[0] + A[1])

Submission status: Accepted

Solution code:
a = sorted(list(input()), reverse=True)
print(int(''.join(a[:2])) + int(a[2]))

Submission status: Accepted

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

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

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,raw_input().split())
max_num=A
if max_num < B:
    max_num = B
if max_num < C:
    max_num= C
print max_num*9+(A+B+C)

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
max_num = a
if max_num < b:
    max_num = b
if max_num < c:
    max_num = c

print max_num * 9 + (a + b + c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = tuple(map(int,input().split()))
M = max(a)
m = min(a)
n = sorted(a)[-2]

print(10*M + n + 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 = map(int, input().split())
ans = 0
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(a, b, c)
print(9 * x + sum([a, b, c]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def calc_max_fomula_by_list(numbers: list) -> int:
    sorted_numbers = numbers
    sorted_numbers.sort(reverse=True)
    return sorted_numbers[0] * 10 + sorted_numbers[1] + sorted_numbers[2]
    

def main():
    inputs = list( map(lambda x:int(x), input().split(' ')) )
    print(calc_max_fomula_by_list(inputs))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
def input():
    return sys.stdin.readline()[:-1]
a,b,t = map(int,input().split(' '))

S = a+b+t
M = max(a,b,t)
print(M*10+(S-M))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arr = list(map(str, input().split()))
arr.sort()
arr.reverse()

x = arr[0] + arr[1]
x = int(x)
print(x+int(arr[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
v = list(map(int, input().split()))
v.sort()
d = v.pop()
print(10 * d + sum(v))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    ABC = input().split()
    ABC.sort(reverse=True)
    print(int(ABC[0] + ABC[1]) + int(ABC[2]))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))
h = [A, B, C]
maxvalue = -1
for i in h:
    if i > maxvalue:
        maxvalue = i
minvalue = 10
for i in h:
    if i < minvalue:
        minvalue = i
print(maxvalue*10+A+B+C-maxvalue-minvalue+minvalue)

Submission status: Accepted

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

Submission status: Accepted

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

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 = list(map(int, input().split()))
a= sorted(a, reverse=True)

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = num_s[0] * 10 + num_s[1] + num_s[2]

print(ans)

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

Submission status: Accepted

Solution code:
card = list(map(int, input().split()))
A = max(card)
A_index = card.index(max(card))
ans = 0
for i in range(3):
    ans+=card[i]
    if i == A_index:
        ans-=card[i]
print(ans+10*A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
 
a,b,c = sorted(map(int,readline().split()))
print (10 * c  + b + a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

output = max_num * 10 + sum(nums)

print(output)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
S = input().split()
m = 0
for n in itertools.permutations(range(3)):
    m = max(m, eval(S[n[0]]+"+"+S[n[1]]+S[n[2]]))
print(m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = list(input())

num.sort(reverse=True)
X = num[0] + num[1]

print(int(X) + int(num[2]))

Submission status: Accepted

Solution code:
L = sorted(input().split())[::-1]
A = L[0]+L[1]
B = L[-1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 22, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c = map(int, readline().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())

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    A,B,C=map(int,input().split())
    M=max(A,B,C)
    ans=M*10
    f=False
    for x in A,B,C:
        if x!=M or f:
            ans+=x
        else:
            f=True
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations


def solve():
    A, B, C = map(str, input().split())
    ans = 0
    for a, b, c in permutations(A + B + C, 3):
        ans = max(ans, int(a + b) + int(c))
    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

largest = max(A, B, C)
smallest = min(A, B, C)
mid = A + B + C - largest - smallest
ans = 10 * largest + mid + smallest

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys
input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

# import math
# import string
# import fractions
# from fractions import Fraction
# from fractions import gcd

# def lcm(n,m):
#     return int(n*m/gcd(n,m))

# import re
# import array
# import copy
# import functools
# import operator

# import collections
# import itertools
# import bisect
# import heapq


# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace

# from queue import PriorityQueue as pq

# def reduce(p, q):
#     common = fractions.gcd(p, q)
#     return (p//common , q//common )
# # from itertools import accumulate
# # from collections import deque

# from operator import mul
# from functools import reduce

# def combinations_count(n, r):
#     r = min(r, n - r)
#     numer = reduce(mul, range(n, n - r, -1), 1)
#     denom = reduce(mul, range(1, r + 1), 1)
#     return numer // denom

# import random
# import time


def main():
    l = list(map(int, input().strip().split()))
    l.sort(reverse=True)
    # eprint("l ", end=": ")
    # eprint(l)
    print(10*l[0]+l[1]+l[2])
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    x = [y for y in map(int,input().split())]
    x.sort()
    ans = x[2] * 10 + x[1] + x[0]
    print(ans)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    lis = list(input().split())
    anolis = sorted(lis, reverse=True)
    anolis.insert(2,'+')
    print(eval(''.join(anolis)))
 
main()

Submission status: Accepted

Solution code:
def main():
    from sys import stdin
    r = stdin.readline()[:-1]
    #n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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())
r = max(A,B,C)*9 + A+B+C
print(int(r))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
L=sorted([A,B,C])
print(int(str(L[-1]) + str(L[-2])) + L[0])

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    lis = list(input().split())
    anolis = sorted(lis, reverse=True)
    anolis.insert(2,'+')
    print(eval(''.join(anolis)))

main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

a = sys.stdin.readline().split()

def main():
    a.sort(reverse=True)
    a.insert(2, '+')
    return eval(''.join(a))

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

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

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())

t = max(a, b, c)

if t == a:
    print(a * 10 + b + c)
elif t == b:
    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) * 9 + a + b + c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(lambda x: int(x), input().split())
lis = [a, b, c]
lis.sort()
lis.reverse()

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

Submission status: Accepted

Solution code:
import itertools
lst = list(map(str,input().split()))
lst1 = list(itertools.permutations(lst))

ans_array = []
for i in range(len(lst1)):
    num1 = int(lst1[i][0]+lst1[i][1]) + int(lst1[i][2])
    num2 = int(lst1[i][0]) + int(lst1[i][1]+lst1[i][2])
    ans_array.append(num1)
    ans_array.append(num2)
print(max(ans_array))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
li = [int(i) for i in input().split()]
li.sort()
print(li[2] * 10 + li[1] + li[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


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

Submission status: Accepted

Solution code:
a, b, c = reversed(sorted(input().split()))
print(int(a + b) + int(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 = sorted(list(map(int, input().split())))
print(10*a[2]+a[0]+a[1])

Submission status: Accepted

Solution code:
# coding: utf-8

panels = sorted([int(i) for i in input().rstrip().split(" ")])
panels.reverse()

ans = panels[0] * 10 + (sum(panels) - panels[0])
print(ans)

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:
n=[int(i) for i in input().split()]
m=max(n)
n.remove(m)
print(m*10+n[0]+n[1])

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())

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l = sorted(l, reverse=True)
print(10 * l[0] + 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:
t =list(map(int, input().split()))

t_re=sorted(t, reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst=list(map(int,input().split()))
lst.sort()
print(lst[2]*10+lst[1]+lst[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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c=INTM()
    print(a+b+c+9*max(a,b,c))
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = sorted(map(int, input().split()))
print(10*c + 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:
N = list(map(int,input().split()))
N = sorted(N,reverse=True)
print(int(str(N[0])+str(N[1]))+N[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = [int(i) for i in input().split()]
s.sort()
a, b, c = s
ans = a + b + c*10
print(ans)

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

Submission status: Accepted

Solution code:
import math

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

x = []
for i in range(2):
  x.append(str(l[i]))

y = int(''.join(x))
z = l[2]

print(y + z)

Submission status: Accepted

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

L = sorted(L,reverse=True)
L = list(map(str,L))

print(max(eval(L[0] + "+" + L[1] + L[2]),eval(L[0]  + L[1] + "+" + L[2])))

Submission status: Accepted

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

x = []
for i in range(2):
  x.append(str(l[i]))

y = int(''.join(x))
z = l[2]

print(y + z)

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(A+B+C+max(A,max(B,C))*9)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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