hdu-2602&&POJ-3624---01背包裸题

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=2602

https://vjudge.net/problem/POJ-3624

都是01背包的裸题

这里有01背包训练集，欢迎大佬来AK

hdu2602：

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int T, n, m;
 const int maxn =  + ;
 int dp[maxn], v[maxn], w[maxn];
 int main()
 {
     cin >> T;
     while(T--)
     {
         cin >> n >> m;
         memset(dp, , sizeof(dp));
         for(int i = ; i < n; i++)cin >> v[i];
         for(int i = ; i < n; i++)cin >> w[i];
         for(int i = ; i < n; i++)
         {
             for(int j = m; j >= w[i]; j--)
             {
                 dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
             }
         }
         cout<<dp[m]<<endl;
     }
     return ;
 }

POJ-3624

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int T, n, m;
 const int maxn =  + ;
 int dp[maxn], v[maxn], w[maxn];
 int main()
 {
     //cin >> T;
     {
         cin >> n >> m;
         memset(dp, , sizeof(dp));
         for(int i = ; i < n; i++)cin >> w[i] >> v[i];
         for(int i = ; i < n; i++)
         {
             for(int j = m; j >= w[i]; j--)
             {
                 dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
             }
         }
         cout<<dp[m]<<endl;
     }
     return ;
 }