传送原题
- 优化后dp[j] = max(dp[j], dp[j-b[i]] + a[i]);
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<math.h>
#include<string.h>
#include<sstream>
using namespace std;
int a[1005];
int b[1005];
int dp[1005];
int main() {
ios::sync_with_stdio(false);
int t, n, v;
cin >> t;
while(t --){
cin >> n >> v;
memset(dp,0,sizeof(dp));
for(int i = 1; i <= n; i ++) cin >> a[i];
for(int i = 1; i <= n; i ++) cin >> b[i];
for(int i = 1; i <= n; i ++){
for(int j = v; j >= b[i]; j --){
dp[j] = max(dp[j], dp[j-b[i]] + a[i]);
}
}
cout << dp[v] << endl;
}
return 0;
}