USACO 3.1 Score Inflation(完全背包 模版）

/*
ID: cuizhe
LANG: C++
TASK: inflate
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 100000000
int c[10001],v[10001],p[10001];
int main()
{
int i,j,n,m,ans;
freopen("inflate.in","r",stdin);
freopen("inflate.out","w",stdout);
scanf("%d%d",&m,&n);
for(i = 1;i <= n;i ++)
scanf("%d%d",&v[i],&c[i]);
for(i = 1;i <= n;i ++)
{
for(j = c[i];j <= m;j ++)
{
if(p[j] < p[j-c[i]]+v[i])
p[j] = p[j-c[i]]+v[i];
}
}
ans = 0;
for(i = 1;i <= m;i ++)
ans = max(ans,p[i]);
printf("%d\n",ans);
return 0;
}