hdu 2602 Bone Collector

这是一道送命题，连这种果题都要WA我是多菜啊，但也还好做了这题，基础还是重要的，一道一道的来，循序渐进，加油！

题目链接：https://vjudge.net/problem/HDU-2602

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int maxn = 1005;
int v[maxn] , w[maxn];
int dp[maxn];
int ncase;
int cntn , cntw;

int main () {
    scanf("%d" , &ncase);
    for (int c = 0 ; c < ncase ; c++) {
        memset(dp,0,sizeof(dp));
        memset(v,0,sizeof(v));
        memset(w,0,sizeof(w));
        scanf("%d%d" , &cntn , &cntw);
        for (int j = 1 ; j <= cntn ; j++)
            scanf("%d" , &v[j]);
        for (int j = 1 ; j <= cntn ; j++)
            scanf("%d" , &w[j]);
        for (int i = 1 ; i <= cntn ; i++) {
            for (int j = cntw ; j >= 0 ; j--) {
                if (j-w[i] >= 0) dp[j] = max(dp[j] , dp[j-w[i]]+v[i]);
            }
        }
        printf("%d\n" , dp[cntw]);
    }
}