HDU - 2546 饭卡

Sample Input
1
50
5
10
1 2 3 2 1 1 2 3 2 1
50
0
Sample Output
-45
32

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 #include<string.h>
 4 #include<queue>
 5 #include<algorithm>
 6 #include<cmath>
 7 #include<iostream>
 8 
 9 using namespace std;
10 typedef long long LL;
11 
12 #define INF 0x3f3f3f3f
13 #define N 22000
14 #define MAXN 100000000
15 #define mod 1000000007
16 
17 int dp[N], a[N];
18 
19 int main()
20 {
21     int n,m,i,j,ans;
22 
23     while(scanf("%d", &n),n)
24     {
25         memset(dp,0,sizeof(dp));
26         memset(a,0,sizeof(a));
27 
28         for(i=0;i<n;i++)
29             scanf("%d",&a[i]);
30         scanf("%d", &m);
31 
32         sort(a,a+n);
33 
34         for(i=0;i<n-1;i++)
35             for(j=m-5;j>=a[i];j--)
36             dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
37 
38         if(m>=5)
39         ans=m-(dp[m-5]+a[n-1]);
40         else
41             ans=m;
42 
43         printf("%d\n", ans);
44     }
45     return 0;
46 }