#include <iostream> #include <cmath> #include <cstring> #include <algorithm> using namespace std; struct node { int volume; int value; }data[1000]; int f[1001]; int main() { //freopen("1.txt", "r", stdin); int t; cin >> t; while(t--) { int n, v; cin >> n >> v; for(int i = 0; i < n; i++) cin >> data[i].value; for(int i = 0; i < n; i++) cin >> data[i].volume; int ans = 0; memset(f, -1, sizeof(f)); f[0] = 0; for(int i = 0; i < n; i++) { for(int j = v; j >= data[i].volume; j--) { if(f[j - data[i].volume] != -1) { f[j] = max(f[j], f[j - data[i].volume] + data[i].value); ans = max(ans, f[j]); } } } cout << ans << endl; } return 0; }
