0 - 1 Knapsack Problem with dp

#include <bits/stdc++.h>
using namespace std;

int fun(int*val,int*w,int n,int weight)
{
    int dp[n+1][weight+1];
    
    memset(dp,0,sizeof(dp));
    
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j<=weight;j++)
        {
            if(i==0 || j==0)
              dp[i][j]=0;
            else if(w[i-1]<=j)
             dp[i][j] = max(val[i-1]+dp[i-1][j-w[i-1]],dp[i-1][j]);
            else
             dp[i][j] = dp[i-1][j];
        }
    }
    
    return dp[n][weight];
}







int main() {
	
	int t; cin>>t;
	
	while(t--)
	{
	    int n,weight; cin>>n>>weight; int val[n],w[n];
	    
	    for(int i=0;i<n;i++)
	       cin>>val[i];
	       
	   for(int i=0;i<n;i++)
	       cin>>w[i];
	       
	    cout<<fun(val,w,n,weight)<<endl;    
	    
	    
	}
	
	
	
	
	
	
	
	
	
	
	return 0;
}