[SW Expert Academy] 0/1 Knapsack (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWBJAVpqrzQDFAWr&categoryId=AWBJAVpqrzQDFAWr&categoryType=CODE&problemTitle=Knap&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&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 k = sc.nextInt();
            int dp[] = new int[k + 1];
 
            for (int i = 0; i < n; i++) {
 
                int v = sc.nextInt();
                int c = sc.nextInt();
 
                for (int j = k; j >= v; j--) {
                    dp[j] = Math.max(dp[j], dp[j - v] + c);
                }
 
            }
            System.out.println("#"+tc+" "+dp[k]);
 
        }
 
    }
}

 

https://hessepark.tistory.com/600

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

위 문제와 동일한 문제이다.