Jin's Library

[Gold Ⅴ] 12865 - 평범한 배낭 본문

Algorithm - Java/BOJ - Gold

[Gold Ⅴ] 12865 - 평범한 배낭

Linkin 2025. 10. 20. 17:39
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class BOJ_12865 { 
    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int N = Integer.parseInt(st.nextToken());
        int weight = Integer.parseInt(st.nextToken());
        int[] W = new int[N];
        int[] V = new int[N];
        int[] dp = new int[weight+1];

        for(int i = 0; i < N ; i++){
            st = new StringTokenizer(br.readLine());
            W[i] = Integer.parseInt(st.nextToken());
            V[i] = Integer.parseInt(st.nextToken());
        }

        for(int i = 0; i < N; i++){
            int a = W[i];
            int b = V[i];  
            // for(int j = a; j <= weight; j++)
            for(int j = weight; j >= a; j--)
                dp[j] = Math.max(dp[j], dp[j-a] + b);
        }
        System.out.println(Arrays.stream(dp).max().getAsInt());
        // System.out.println(Arrays.toString(dp));
    }
}

// 각 Weight 당 최대의 Value를 뽑아내야 한다.

'Algorithm - Java > BOJ - Gold' 카테고리의 다른 글

[Gold Ⅴ] 15486 - 퇴사 2  (0) 2025.10.24
[Gold Ⅳ] 2293 - 동전 1  (0) 2025.10.20
[Gold Ⅴ] 1931 - 회의실 배정  (0) 2025.10.17
[Gold Ⅳ] 1043 - 거짓말  (0) 2025.10.02
[Gold Ⅱ] 10775 - 공항  (0) 2025.10.01