hdu_2602

/* * 01背包裸题*/#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define MAXN1001#define MAXV1001int val[MAXN], vol[MAXN], dp[MAXV];int zero_one_package(int n, int max_v){memset(dp, 0, sizeof(dp));for(int i = 0; i < n; i ++) {for(int v = max_v; v >= vol[i]; v --) {dp[v] = max(dp[v], dp[v-vol[i]]+val[i]);}}return dp[max_v];}int main(int argc, char const *argv[]){#ifndef ONLINE_JUDGEfreopen("test.in", "r", stdin);#endifint n, v, cas;scanf("%d", &cas);while( cas -- ) {scanf("%d %d", &n, &v);for(int i = 0; i < n; i ++) {scanf("%d", &val[i]);}for(int i = 0; i < n; i ++) {scanf("%d", &vol[i]);}printf("%d\n", zero_one_package(n, v));}return 0;}