Simple 01 backpack and complete backpack

2020.12.30 Start learning AcWing algorithm "Algorithm Competition Advanced Guide";
upload a blog to facilitate review.

01 backpack (each item can only be used once):

//Wecccccccc
//2020.12.31
#include <iostream>
using namespace std;
int n,m,v[1010],w[1010],dp[1010];
int main()
{
    
    
    cin>>n>>m;
    for (int i=1;i<=n;i++)
    {
    
    
        cin>>v[i]>>w[i];
    }
    for (int i=1;i<=n;i++)
    {
    
    
        for (int j = m;j>=v[i];j--)
        {
    
    
            dp[j] = max(dp[j],dp[j-v[i]]+w[i]);
        }
    }
    cout<<dp[m]<<endl;
    return 0;
}

Complete backpack (unlimited pieces available for each item):

//Wecccccccc
//2020.12.31
#include <iostream>
using namespace std;
int n,m,v[1010],w[1010],dp[1010];
int main()
{
    
    
    cin>>n>>m;
    for (int i=1;i<=n;i++)
    {
    
    
        cin>>v[i]>>w[i];
    }
    for (int i=1;i<=n;i++)
    {
    
    
        for (int j = v[i];j<=m;j++)
        {
    
    
            dp[j] = max(dp[j],dp[j-v[i]]+w[i]);
        }
    }
    cout<<dp[m]<<endl;
    return 0;
}