c_cpp //背包问题的变种

Posted 2021-05-14

#include <bits/stdc++.h>
using namespace std;
#define MIN  -100001
int maxweight(int w,int n,int val[],int wt[]){
	int dp[w+1];
	for(int i = 1;i <= w;i++){
		dp[i] = MIN;
	}
	dp[0] = 0;
	for(int z = 1;z <= w;z++){
		for(int j = 0;j < n;j++){
			if(wt[j] <= z && dp[z - wt[j]] != MIN){
				dp[z] = max(dp[z],val[j] + dp[z - wt[j]]);
			}
		}
	}
	for(int z = w;z >= 0;z--){
	     if(dp[z] != MIN){
	     	return z;
	     }
	}
return 0;	
}
int main() {
	int w;
	cin >> w;
	int n;
	cin >> n;
	int val[n];
	int wt[n];
	for(int i = 0;i < n;i++){
		cin >> val[i];
	}
	for(int i = 0;i < n;i++){
		cin >> wt[i];
	}
    cout << maxweight(w,n,val,wt) << endl;
	return 0;
}