[백준] 2798번 블랙잭

링크 : https://www.acmicpc.net/problem/2798

문제

풀이

from itertools import combinations

n,m = map(int, input().split())
array = list(map(int, input().split()))

sum_combi = [sum(i) for i in list(combinations(array, 3))]
max_sum = 0

for i in sum_combi:
    if i <= m:
        max_sum = max(i, max_sum)
print(max_sum)