HDU 2602 Bone Collector

http://acm.hdu.edu.cn/showproblem.php?pid=2602

水题一道，依旧是0/1背包的问题。。。加深理解O(∩_∩)O~

#include <iostream>
#define maxn 1005
using namespace std;
long ans[maxn], v[maxn], w[maxn];
int main()
{
    long t, n, m, i,j;
    cin >> t;
    while(t--)
    {
        cin >> n >> m;
        for(i = 0; i < n; i++)
        cin >> w[i];
        for(i = 0; i < n; i++)
        cin >> v[i];
        for(i = 0; i <= m; i++)
        ans[i] = 0;
        for(i = 0; i < n; i++)
        for(j = m; j >= v[i]; j--)
        if(ans[j-v[i]] + w[i] > ans[j])
          ans[j] = ans[j-v[i]]+w[i];
        cout << ans[m]<< endl;  
    }
    return 0;
}