hdu--2546--dp<01背包>

 1 #include <iostream>
 2 #include <cstring>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 const int size = 1010;
 7 int arr[size];
 8 int dp[size];
 9 
10 void zeroOne( int n , int m )
11 {
12     for( int i = 0 ; i<n ; i++ )
13     {
14         for( int j = m ; j>=arr[i] ; j-- )
15         {
16             dp[j] = max( dp[j] , dp[ j-arr[i] ] +arr[i] );
17         }
18     }
19 }
20 
21 int main()
22 {
23     int n , m , money , sum;
24     while( cin >> n && n )
25     {
26         memset( dp , 0 , sizeof(dp) );
27         for( int i = 0 ; i<n ; i++ )
28         {
29             cin >> arr[i]; 
30         }
31         cin >> m;
32         money = m;
33         if( m<5 )
34         {
35             cout << m << endl;
36         }
37         else
38         {
39             sort( arr , arr+n );
40             zeroOne(n-1,m-5);
41             cout << m-dp[m-5]-arr[n-1]<<endl;
42         }
43     }
44     return 0;
45 }