学步园

很裸的完全背包...

code：

/*
    ID:yueqi
    LANG:C++
    TASK:inflate
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits.h>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("inflate.in","r",stdin)
#define writef freopen("inflate.out","w",stdout)
const int maxn = 10001;
const long long BigP=999983;
const long long  INF = 0x5fffffff;
const int dx[]={-1,0,1,0};
const int dy[]={0,1,0,-1};
const double pi = acos(-1.0);
const double eps= 1e-7;
using namespace std;
int N,M;
int a[maxn],v[maxn],dp[maxn];
int main(){
    readf;
    writef;
    SD(N);SD(M);
    FOR(i,1,M){
        SD(v[i]);SD(a[i]);
    }
    FOR(i,1,M) FOR(j,a[i],N){
        dp[j]=max(dp[j],dp[j-a[i]]+v[i]);
    }
    PD(dp[N]);LN;
    return 0;
}