NYOJ 311 完全背包

http://acm.nyist.net/JudgeOnline/problem.php?pid=311

#include <stdio.h>
#define maxn 50005
#define INF -1
int ans[maxn],v[maxn],w[maxn];
int main()
{
    int t, n, m, i, j;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(i=0; i<n; i++)
        scanf("%d%d",&v[i],&w[i]);
        for(i=0; i<=m; i++)
        ans[i]=INF;
        ans[0]=0;
        for(i=0; i<n; i++)
        {
            for(j=0; j<=m; j++)
            if(j>=v[i] && ans[j-v[i]]!=-1 && ans[j-v[i]]+w[i]>ans[j])
            ans[j] = ans[j-v[i]]+w[i];
        }
        if(ans[m] == INF) printf("NO\n");
        else printf("%d\n",ans[m]);
    }
    return 0;
} 

看了下标程才恍然大悟，原来可以边输入边处理背包....自己一直都是先输入完...o(╯□╰)o