Submission #70957150

Source Code Expand

import sys, bisect, heapq
from collections import defaultdict, deque, OrderedDict, Counter
from itertools import combinations, permutations
sys.setrecursionlimit(10**7)
#d = defaultdict()

l = sorted(list(map(str,input().split())), reverse = True)
ans = ""
for i in l:
    ans = ans + i
print(int(ans))

Submission Info

Submission Time
Task A - Permute to Maximize
User Jammy
Language Python (PyPy 3.11-v7.3.20)
Score 100
Code Size 312 Byte
Status AC
Exec Time 77 ms
Memory 96428 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 18
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 77 ms 96032 KiB
00_sample_01.txt AC 77 ms 96220 KiB
00_sample_02.txt AC 77 ms 96060 KiB
01_test_00.txt AC 77 ms 95904 KiB
01_test_01.txt AC 77 ms 96356 KiB
01_test_02.txt AC 77 ms 96044 KiB
01_test_03.txt AC 77 ms 96128 KiB
01_test_04.txt AC 77 ms 96428 KiB
01_test_05.txt AC 77 ms 96044 KiB
01_test_06.txt AC 77 ms 95904 KiB
01_test_07.txt AC 77 ms 96356 KiB
01_test_08.txt AC 77 ms 96036 KiB
01_test_09.txt AC 77 ms 96388 KiB
01_test_10.txt AC 77 ms 96116 KiB
01_test_11.txt AC 77 ms 96104 KiB
01_test_12.txt AC 77 ms 96224 KiB
01_test_13.txt AC 77 ms 96044 KiB
01_test_14.txt AC 77 ms 96232 KiB