SWEA 5215. 햄버거 다이어트

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWT-lPB6dHUDFAVT

SW Expert Academy

 

전체 코드

class Solution:
    def __init__(self):
        self.max_score = 0

    def do(self, materials, limit_cal):
        # (점수, 칼로리)
        def dfs(path, start):
            score, cal = path
            if cal < limit_cal and score > self.max_score:
                self.max_score = score

            for i in range(start, len(materials)):
                (add_score, add_cal) = materials[i]
                (new_score, new_cal) = score + add_score, cal + add_cal
                dfs((new_score, new_cal), i + 1)

        dfs((0, 0), 0)

        return self.max_score

# --- submit ---
T = int(input())
for test_case in range(1, T + 1):
    n, l = map(int, input().split())
    materials = []
    for _ in range(n):
        materials.append(tuple(map(int, input().split())))

    result = Solution().do(materials, l)
    print(f'#{test_case} {result}')