[ SW Expert Academy ] 5215. 햄버거 다이어트
아.. 간만에 시간초과.. 짜릿하네 ^^ 1차 제출 [ 10 / 20 ] FAIL , 17분 def dfs(array, score, total_calory, depth): global result if depth == n : return result = max(result, score) for i in range(n): if not visited[i] and total_calory + array[i][1] < limit: visited[i] = True dfs(array, score + array[i][0], total_calory+array[i][1], depth+1) visited[i] = False T = int(input()) for tc in range(1, T+1): n, limit = map..