开心的小明 南工49

0-1背包

# include <iostream>
# include <string.h>
using namespace std;
int main()
{
	int N, n, m, a[30001], max, i, b, c, j;
//	freopen("in.txt", "r", stdin);
	cin>>N;
	while (N--)
	{
		cin>>n>>m;
		memset(a, 0, sizeof(a));
		for (i = 1; i<=m; i++)
		{
			cin>>b>>c;
			for (j = n; j>=b; j--)//计算用j元买前i个的最优解
			{
				if (a[j]<b*c+a[j-b])
					a[j]=b*c+a[j-b];
			}
		}
		cout<<a[n]<<endl;
	}
	return 0;
}