package LeetCode;

import java.util.Arrays;

public class LC_1049 {
    public static void main(String[] args) {
        System.out.println(lastStoneWeightII(new int[]{31,26,33,21,40}));
    }

    public static int lastStoneWeightII(int[] stones) {
        int sum = Arrays.stream(stones).sum();
        int tar = sum / 2;
        int[] dp = new int[tar + 1];
        int num = stones.length;
        for (int i = 0; i < stones.length; i++) {
            for (int j = tar; j >= stones[i]; j--) {
                dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
            }
        }
        return sum - dp[tar] - dp[tar];
    }
}