dynamic programming first code

//Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
#include<bits/stdc++.h>
using namespace std;

#define ll long long
const int mod = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll  Lnf = (ll)2e18 + 5;
const int N   = 4e5 + 5;


int solve() 
{
	
	ll n,w;
	cin>>n>>w;

	ll val[n+1],wt[n+1];
	/*for(int i=0;i<n;i++) cin>>val[i];
	for(int i=0;i<n;i++) cin>>wt[i];*/

	for(ll i=0;i<n;i++){
		cin>>wt[i]>>val[i];
	}

	ll dp[n+1][w+1];

	memset(dp,0,sizeof dp);

	for(ll i=1;i<=n;i++){
		for(ll j=1;j<=w;j++){
			if(j>=wt[i-1]){
				dp[i][j] = max(dp[i-1][j-wt[i-1]]+val[i-1],dp[i-1][j]);
			}else{
				dp[i][j] = dp[i-1][j];
			}
		}
	}

	cout<<dp[n][w]<<endl;


	return 0;
}
int main(){
	int test = 1;
	//scanf("%d", &test);
	while (test--)solve();return 0;
}