题目很简单~~赤果果的多重背包~~~但是!!!!复杂度是O(M*N)的..也就是O(10^8)...呃..最大的一组数据0,3s飘过..USACO的机器给力阿~~这都不超~~
Program:
/*
ID: zzyzzy12
LANG: C++
TASK: inflate
*/
#include<iostream>
#include<istream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stack>
#include<algorithm>
#include<queue>
#define oo 2000000000
using namespace std;
int M,N,w,v,i,dp[10001];
int main()
{
freopen("inflate.in","r",stdin);
freopen("inflate.out","w",stdout);
memset(dp,0,sizeof(dp));
scanf("%d%d",&M,&N);
while (N--)
{
scanf("%d%d",&v,&w);
if (dp[w]<v) dp[w]=v;
for (i=1;i<=M-w;i++)
if (dp[i] && dp[i+w]<dp[i]+v) dp[i+w]=dp[i]+v;
}
N=0;
for (i=0;i<=M;i++)
if (dp[i]>N) N=dp[i];
printf("%d\n",N);
return 0;
}