HDU 2546 饭卡

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int n;
    while(cin >>n && n){
        vector<int> food(n);
        for(int i = 0; i < n; i ++ ) cin >> food[i];
        int price;
        cin >> price;
        if(price < 5) {cout<<price<<endl;continue;}
        sort(food.begin(),food.end());
        vector<int> dp(price - 5 + 1, 0);
        for(int i =0; i < n-1; i ++ ){
            for(int j = price - 5 ; j >= food[i]; j --){
                dp[j] = max(dp[j],dp[j - food[i]]+food[i]);
            }
        }
        cout<< price - dp[price-5] - food[n-1]<<endl;

    }
    return 0;
}