[SW Expert Academy] 햄버거 다이어트 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWT-lPB6dHUDFAVT&categoryId=AWT-lPB6dHUDFAVT&categoryType=CODE&problemTitle=%ED%96%84%EB%B2%84%EA%B1%B0&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
	
		for(int tc=1;tc<=t;tc++) {
			int n = sc.nextInt();
			int l = sc.nextInt();
			
			int dp[]=new int[l+1];
			for(int i=0;i<n;i++) {
				int score= sc.nextInt();
				int cal = sc.nextInt();
				
				for(int j=l;j>=cal;j--) {
					dp[j]=Math.max(dp[j], dp[j-cal]+score);
				}
			}
			
			System.out.println("#"+tc+" "+dp[l]);
			
		}
		
		
	}
}

 

평범한 배낭문제의 원리를 그대로 가져온 문제이다.