hdoj 2546 饭卡(0-1背包)

import java.util.*;

public class Main {
    static final int MAX_N = 1000 + 10;
    static int[] c = new int[MAX_N];
    static int[] dp = new int[MAX_N];
    
    static int Max(int a, int b) {
        return a > b ? a : b;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N, V;
        
        while ((N = in.nextInt()) != 0) {
            int max_value = 0;
            
            Arrays.fill(dp, 0);
            for (int i = 0; i < N; ++ i) {
                c[i] = in.nextInt();
                if (c[i] > max_value)
                    max_value = c[i];
            }
            Arrays.sort(c, 0, N);
            V = in.nextInt();
            for (int i = 0; i < N - 1; ++ i) {
                for (int v = V - 5; v >= c[i]; -- v) {
                        dp[v] = Max(dp[v], dp[v - c[i]] + c[i]);
                }
            }
            if (V < 5)
                System.out.println(V);
            else
                System.out.println(V - dp[V-5] - c[N - 1]);
        }
    }
}