/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 37ms 2.832 MiB

Code

def max_number(arr, k):
    arr.sort(reverse=True)
    n = len(arr)
    for _ in range(k):
        arr[-2] = str(arr[-2]) + str(arr[-1])
        arr.pop()
    return int(arr[-1])

t = int(input())
for _ in range(t):
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    print(max_number(arr, k))

Information

Submit By
Type
Pretest
Problem
P1083 Number concatenation
Language
Python 3 (Python 3.12.3)
Submit At
2024-08-16 15:56:43
Judged At
2024-08-16 15:56:43
Judged By
Score
0
Total Time
37ms
Peak Memory
2.832 MiB