传送原题
![在这里插入图片描述](https://img-blog.csdnimg.cn/2020040215451354.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3h1aGFuZzUxMw==,size_16,color_FFFFFF,t_70)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200402154950876.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3h1aGFuZzUxMw==,size_16,color_FFFFFF,t_70)
- 优化后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;
}