开心的金明 题解

题目在主页，如有出错请指出

include <bits/stdc++.h>

using namespace std;

int v[105], w[105], f[100005];

int main()
{
int m, n;
scanf("%d %d", &m, &n);
for (int i = 1; i <= n; i++)
scanf("%d %d", &v[i], &w[i]);
for (int i = 1; i <= n; i++)
for (int j = m; j >= v[i]; j--)
f[j] = max(f[j], f[j - v[i]] + v[i] * w[i]);
cout << f[m] << endl;
return 0;
}