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: Wrong Answer

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

abc = inpl()
abc.sort()

print(abc[2]*9+abc[0]+abc[1])

Submission status: Wrong Answer

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

if a >= b & a >= c:
    print(10 * a + b + c)
else:
    if b >= c:
        print(10 * b + a + c)
    else:
        print(10 * c + a + b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

a, b, c = map(int, input().split())
if a > b:
    if a > c:
        a *= 10
    else:
        c *= 10
else:
    b *= 10

print(a + b + c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

if a*10 + b + c > a + b*10 + c:
    print(a*10 + b + c)
else:
    print(a + b*10 + c)

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a + b > b + c:
    print(str(a*10+b+c))
else:
    print(str(a+b*10+c))

Submission status: Wrong Answer

Solution code:
ai = lambda: list(map(int,input().split()))
ai_ = lambda: [int(x)-1 for x in input().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Accepted

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

t = sorted([A, B, C])
print(t[0] + t[1] + t[2] * 10)

Submission status: Accepted

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

a.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n_l.sort(reverse=True)

print(int(n_l[0] + n_l[1]) + int(n_l[-1]))

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

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc110/tasks/abc110_a"

def main():
    t = list(map(int, input().split()))
    t.sort(reverse=True)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
lis = []
li = input().split()

li.sort()

lis.append(li[2] + li[1])
lis.append(li[0])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    data = sorted(Input(), reverse=True)
    print(int(str(data[0])+str(data[1])) + data[2])


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC110A
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()))
print(10 * max(a) + sum(a) - max(a))

Submission status: Accepted

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

Submission status: Accepted

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

A.sort()
A=A[::-1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
A = sorted(A, reverse=True)
print(int("".join(map(str,A[:2]))) + A[-1])

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a>=b>=c or a>=c>=b:
    print(10*a+b+c)
elif c>=a>=b or c>=b>=a:
    print(10*c+a+b)
else:
    print(10*b+a+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:
n = map(int, input().split())
list_num = list(n)
list_num.sort()
list_str = []
for i in list_num:
    i = str(i)
    list_str.append(i)

max_str = list_str[-1] + list_str[1]
max_int = int(max_str)
print(max_int + int(list_str[0]))

Submission status: Accepted

Solution code:
l=input().split()
ld = sorted(l, reverse=True)
#print(ld)
a=ld[0]+ld[1]
b=ld[2]
m=int(a)
n=int(b)
print(m+n)

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:
# coding=utf-8
from math import floor, ceil, sqrt, factorial, log, gcd
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop, heapify
import copy
import numpy as np
import sys
INF = float('inf')
mod = 10**9+7
sys.setrecursionlimit(10 ** 6)


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

# 1 2 3
# a, b, c = LI()


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))

# a = I()


def I(): return int(sys.stdin.buffer.readline())

# abc def
# a, b = LS()


def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()

# a = S()


def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')

# 2
# 1
# 2
# [1, 2]


def IR(n): return [I() for i in range(n)]

# 2
# 1 2 3
# 4 5 6
# [[1,2,3], [4,5,6]]


def LIR(n): return [LI() for i in range(n)]

# 2
# abc
# def
# [abc, def]


def SR(n): return [S() for i in range(n)]

# 2
# abc def
# ghi jkl
# [[abc,def], [ghi,jkl]]


def LSR(n): return [LS() for i in range(n)]

# 2
# abcd
# efgh
# [[a,b,c,d], [e,f,g,h]]


def SRL(n): return [list(S()) for i in range(n)]


def main():
    n = list(LI())
    m = max(n)
    n.remove(m)
    print(m*10+sum(n))


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    a, b, c = map(int, readline().split())
    print(max(a, b, c) * 10 + a + b + c - max(a, b, c))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ABC = input().split()
m = max(ABC)
ABC.remove(m)

print(eval(m + ABC[0] + '+' + ABC[1]))

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
a = max(x)
b = min(x)
x.remove(a)
x.remove(b)
c = x[0]
a = str(a)
b = str(b)
ab = int(a+b)
print(ab+c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input().split()
a.sort(reverse=True)
if len(set(a))==1:
  print(12*int(a[0]))
else:
  ans=int(a[0]+a[1])+int(a[2])
  print(ans)

Submission status: Accepted

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

if A >= B and A >= C:
  print(int(A*10+B+C))
elif B >= A and B >= C:
  print(int(B*10+A+C))
else:
  print(int(C*10+A+B))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(10*c+b+a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
M = max(a, b, c)
r = a+b+c-M

print(10*M + r)

Submission status: Accepted

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

if a == max(a,b,c):
    ans = int(a+b) + int(c)
elif b == max(a,b,c):
    ans = int(b+a) + int(c)
else:
    ans = int(c+a) + int(b)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc=sorted(list(map(int,input().split())),reverse=True)
a=[1]*10
for i in range(10**7+5*10**6):
    a.append(a)
print(sum(abc)+abc[0]*9)

Submission status: Accepted

Solution code:
abc=sorted(list(map(int,input().split())),reverse=True)
a=[1]*10
for i in range(10**7):
    a.append(a)
print(sum(abc)+abc[0]*9)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = a[0]
y = a[2]+a[1]

print(int(x)+int(y))

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(a[-1]*10+sum(a[:-1]))

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [input() for _ in range(n)]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    A = sorted(nl())
    print(eval(str(A[2]) + str(A[1]) + '+' + str(A[0])))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
i = l.index(max(l))
print(l.pop(i) * 10 + sum(l))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    a = list(map(int, input().split()))
    sorted_a = sorted(a)
    print(int(str(sorted_a[2]) + str(sorted_a[1])) + sorted_a[0])


if __name__ == "__main__":
    main()

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().strip().split(" "))
k=max(a,b,c)
print(9*k+a+b+c)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
ans = 0
if(A>=B and A>=C):
    ans = max(A*10+B+C,ans)
if(B>=A and B>=C):
    ans = max(B*10+A+C,ans)
else:
    ans = max(C*10+A+B,ans)
print(str(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:
S = list(map(int, input().split()))
S.sort()
print(S[2]*10+S[1]+S[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

abc = inl()

ans = sum(abc)
max_n = max(abc)

print(ans - max_n + max_n*10)

Submission status: Accepted

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

N = sorted(N, reverse=True)
print(N[0]*10 + N[1] + N[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=sorted(input().split());print(int(n.pop()+n.pop())+int(n.pop()))

Submission status: Accepted

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

Submission status: Accepted

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

x = 10 * a + b + c
y = 10 * b + a + c
z = 10 * c + a + b

print(max(x, y, z))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(max_value)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	A = list(map(int,input().split()))
	B = sorted(A,reverse=True)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = list(input().split())
num.sort(reverse=True)
print(int(''.join(num)[:2]) + int(''.join(num)[2]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc110_a.py
# https://atcoder.jp/contests/abc110/tasks/abc110_a

# A - Maximize the Formula /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# あなたは子供にゲームをプレイさせ、その結果に応じてお小遣いをあげることにしました。
# そのゲームの内容は以下の通りです。
#     1以上 9 以下の整数 1 つが書かれた整数パネル 3 枚と + が書かれた演算子パネル 1枚がある
#     これら 4枚のパネルを横一列に並べて X+Yの形の数式を作る (すなわち、演算子パネルを端に置くことはできない)
#     数式を計算した結果と同じ値のお小遣いをあげる

# ゲームで使用する各整数パネルの値 A,B,Cが与えられるので、あげることになり得るお小遣いの最大値を求めてください。

# 制約
#     入力はすべて整数である
#     1≤A,B,C≤9

# 入力
# 入力は以下の形式で標準入力から与えられる。
# A B C

# 出力
# あげることになり得るお小遣いの最大値を出力せよ。

# 入力例 1
# 1 5 2

# 出力例 1
# 53

# 52+1 と並べたときにあげることになるお小遣いは 53となりこれが最大です。

# 入力例 2
# 9 9 9

# 出力例 2
# 108

# 入力例 3
# 6 6 7

# 出力例 3
# 82


def calculation(lines):
    # N = int(lines[0])
    a, b, c = list(map(int, lines[0].split()))
    result = max(a, b, c) * 9 + a + b + c
    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1 5 2']
        lines_export = [53]
    if pattern == 2:
        lines_input = ['9 9 9']
        lines_export = [108]
    if pattern == 3:
        lines_input = ['6 6 7']
        lines_export = [82]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

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

input = sys.stdin.readline


def main():
    A, B, C = input().split()

    ans = max(int(A + B) + int(C), int(B + C) + int(A), int(C + A) + int(B))

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
from fractions  import gcd
#input=sys.stdin.readline
import bisect
a,b,c=map(int,input().split())
print(max(a+10*b+c,10*a+b+c,10*c+a+b))

Submission status: Accepted

Solution code:
def resolve():
    import itertools
    A = [i for i in input().split()] + ["+"]
    maxA = 0
    for a in itertools.permutations(A):
        if a[0] != "+" and a[-1] != "+":
            maxA = max(maxA, eval("".join(a)))
    print(maxA)


resolve()

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline  #文字列では使わない
#A,B,C = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans =A[0]*10 +A[1] +A[2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

num_list = sorted(num_list)

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

Submission status: Accepted

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

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = sorted(map(int, readline().split()), reverse=True)
print(n[0]*10+n[1]+n[2])

Submission status: Accepted

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

print(10*C + A + B)

Submission status: Accepted

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