总分

一个背包。。。。

#include<iostream>
using namespace std;
int m, n;  
int a[10001], b[10001];  
int c[10001], ans = -1;  
int main()  
{  
    freopen("inflate.in","r",stdin);  
    freopen("inflate.out","w",stdout);  
    scanf("%d%d", &m, &n);  
    for (int i = 0; i != n; ++ i)   scanf("%d%d", &a[i], &b[i]);//价值 体积  
    memset(c, -1, sizeof(c));  
    c[0] = 0;  
    for (int i = 0; i != n; ++ i)  
        for (int j = 0; j <= m-b[i]; ++ j)  
        {  
            if (c[j]!=-1)     
            {  
                c[j+b[i]] = max(c[j+b[i]], c[j] + a[i]);  
                ans = max(c[j + b[i]], ans);  
            }  
        }  
    printf("%d\n", ans);  
    return 0;  
}