[SWEA] 0/1 Knapsack

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWBJAVpqrzQDFAWr

SW Expert Academy

 

 

 

[소스 코드]

import java.util.*;
import java.io.*;
public class Solution {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			int k = Integer.parseInt(st.nextToken());
			int[] volume = new int[n+1];
			int[] value = new int[n+1];
			for(int i=1;i<=n;i++) {
				st = new StringTokenizer(br.readLine());
				volume[i] = Integer.parseInt(st.nextToken());
				value[i] = Integer.parseInt(st.nextToken());
			}
			int[][] dp = new int[n+1][k+1];
			for(int i=1;i<=n;i++) {
				for(int v=1;v<=k;v++) {
					if(volume[i]>v) {
						     dp[i][v] = dp[i-1][v];
					}
					else {
						dp[i][v] = Math.max(dp[i-1][v], dp[i-1][v-volume[i]]+value[i]);
					}
				}
			}
			System.out.println("#"+tc+" "+dp[n][k]);
		}
	}
}