USACO--3.1Score Inflation+完全背包问题

就是一简单的完全背包问题，秒杀。

代码如下：

/*
ID:15674811
LANG:C++
PROG:inflate
*/

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

#define maxn 11000

int main()
{
    freopen("inflate.in","r",stdin);
    freopen("inflate.out","w",stdout);
    ///freopen("lkl.txt","r",stdin);
    int dp[maxn],n,m;
    int W[maxn],V[maxn];
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
            scanf("%d%d",&W[i],&V[i]);
        for(int i=1;i<=n;i++)
            for(int j=V[i];j<=m;j++)
                 dp[j]=max(dp[j],dp[j-V[i]]+W[i]);
        printf("%d\n",dp[m]);
    }
  return 0;
}