/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 15ms 2.828 MiB

Code

def max_number(arr, k):
    n = len(arr)
    dp = [[0] * (k+1) for _ in range(n)]

    # Base cases
    for i in range(n):
        dp[i][0] = arr[i]

    for i in range(n):
        for j in range(1, k+1):
            for p in range(i):
                dp[i][j] = max(dp[i][j], dp[p][j-1] * 10**(i-p) + arr[p])

    return max(dp[i][k] for i in range(n))

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:58:47
Judged At
2024-08-16 15:58:47
Judged By
Score
0
Total Time
15ms
Peak Memory
2.828 MiB