Luogu P1060 开心的金明 [NOIP 2006 普及组]

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>

using namespace std;

int f[30005];

int main () {
	int n,m;
	memset (f,-1,sizeof (f)); f[0]=0;
	scanf ("%d%d",&n,&m);
	for (int i=1;i<=m;i++) {
		int v,p,k;
		scanf ("%d%d",&v,&p);
		k=v*p;
		
		for (int j=n;j>=v;j--) {
			if (f[j-v]==-1) continue;
			f[j]=max (f[j-v]+k,f[j]);
		}
	}
	int ans=0;
	for (int i=0;i<=n;i++) {
		ans=max (f[i],ans);
	}
	printf ("%d\n",ans);
	return 0;
}