[baekjoon]python #2798 블랙잭

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

2798번: 블랙잭

 

def dfs(cnt,level):
    global Max,cards
    if level == 2:
        if cnt<=m:
            if Max<cnt:
                Max=cnt
        return

    for i in range(n):
        if visit[i]==1:continue
        visit[i]=1
        dfs(cnt+cards[i],level+1)
        visit[i]=0


n,m = map(int,input().split())
cards=list(map(int,input().split()))
visit=[0]*n
Max=0
for i in range(n):
    visit[i] = 1
    dfs(cards[i],0)
    visit[i]=0

print(Max)