python 백준 12865 평범한 배낭 https://www.acmicpc.net/problem/12865 N,K = map(int,input().split()) backpack = [0]*(K+1) for _ in range(N): W,V = map(int,input().split()) for i in range(len(backpack))[::-1]: if backpack[i] and i + W 알고리즘 문제 풀이/Python 2022.06.21