Submission #16609578

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;;

int main(){

	long long n,w;
	cin>>n>>w;
	
	long long berat[n],value[n];
	
	for (long long i=1;i<=n;i++){
		cin>>berat[i]>>value[i];
	}
	
	long long dp[n+1][w+1];
	
	memset(dp,0,sizeof dp);
	
	for (long long i=1;i<=n;i++){
		for (long long j=0;j<=w;j++){
			dp[i][j]=dp[i-1][j];
			if (j-berat[i]>=0){
				dp[i][j]=max(dp[i][j],dp[i-1][j-berat[i]]+value[i]);
			}
		}
	}

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

	return 0;
}

Submission Info

Judge Result