code $↓$ $↓$ $↓$

#include <iostream>  
#include <cstring>  
using namespace std;  
  
const int MAXN = 1005;  
const int MAXW = 1005;  
int dp[MAXW];
int w[MAXN];
int v[MAXN];
  
int main()
{  
    int n, W;  
    cin >> n >> W;  
    for (int i = 1; i <= n; i++) {  
        cin >> w[i] >> v[i];  
    }  
    for (int i = 1; i <= n; i++) {  
        for (int j = W; j >= w[i]; j--) {  
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);  
        }  
    }  
    cout << dp[W] << endl;  
    return 0;  
}