[백준] 큰 수 구성하기

문제

from itertools import product

n, k = map(int, input().split())
num_list = sorted(map(str, input().split()), reverse=True)  

max_length = len(str(n))

def find_largest_combination():
    for length in range(max_length, 0, -1):
        for c in product(num_list, repeat=length):
            answer = int("".join(c))
            if answer <= n:
                return answer

print(find_largest_combination())

PREVIOUS[백준] 색종이 만들기