多重背包之 HDU -1171Big Event in HDU &HDU -2191悼念512汶川大地震遇难同胞——珍惜现在，感恩生活

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 
 5 using namespace std;
 6 
 7 int dp[100000];
 8 int cnt[100];
 9 int value[100];
10 int main()
11 {
12     int n;
13     while (~scanf("%d", &n) && n > 0)
14     {
15         memset(dp, 0, sizeof(dp));
16         int sum = 0;
17         for (int i = 0; i < n; i++)
18         {
19             scanf("%d %d", &value[i], &cnt[i]);
20             sum += value[i] * cnt[i];
21         }
22         int v = sum / 2;
23         for (int i = 0; i < n; i++)
24         {
25             for (int j = v; j >= value[i]; j--)//01背包
26             {
27                 for (int k = 1; k <= cnt[i] && k * value[i] <= j; k++)//遍历每一种
28                     dp[j] = max(dp[j], dp[j - k * value[i]] + k * value[i]);
29             }
30         }
31         printf("%d %d\n", sum - dp[v], dp[v]);
32     }
33     return 0;
34 }

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 
 5 using namespace std;
 6 const int N = 150;
 7 int weight[N];
 8 int value[N];
 9 int cnt[N];
10 int dp[N];
11 int main()
12 {
13     int T;
14     int n, money;
15     scanf("%d", &T);
16     while (T--)
17     {
18         scanf("%d %d", &money, &n);
19         for (int i = 0; i < n; i++)
20             scanf("%d %d %d", &weight[i], &value[i], &cnt[i]);
21         memset(dp, 0, sizeof(dp));
22         for (int i = 0; i < n; i++)
23         {
24             for (int j = money; j >= weight[i]; j--)//01背包
25             {
26                 for (int k = 1; k <= cnt[i] && k * weight[i] <= money; k++)//遍历每一种情况，所以上面是01背包，如果上面用完全背包，就相当于取重了
27                     if (j >= k * weight[i])
28                         dp[j] = max(dp[j], dp[j - k * weight[i]] + k * value[i]);
29             }
30         }
31         printf("%d\n", dp[money]);
32     }
33     return 0;
34 }