REP1060求条

#include <bits/stdc++.h>
using namespace std;
int n,m,w[30],v[30],dp[30][30005];
int main()
{
	cin >> n >> m;
	for (int i = 1;i <= m;i++)
	{
		cin >> v[i] >> w[i];
		w[i] *= v[i];
	}
	for (int i = 1;i <= n;i++)
	{
		for (int j = n;j >= v[i];j--)
		{
			dp[i][j] = max(dp[i - 1][j],dp[i - 1][j - v[i]] + w[i]);	
		}
	}
	cout  << dp[m][n];
	return 0;
}