%%%%%%%%%%%%%%%%%%%%%%%%%
查看原帖
%%%%%%%%%%%%%%%%%%%%%%%%%
1015008
yongshao楼主2024/7/28 15:39

90分,第六点wa,求调%%

#include<iostream>
using namespace std;
int n,m,v[30010],p[30010],dp[3010][30010];
int main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)cin>>v[i]>>p[i];
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++)
			if(j>=v[i])
				dp[i][j]=max(dp[i-1][j],dp[i-1][j-v[i]]+p[i]*v[i]);
	cout<<dp[m][n];
	return 0;
}
2024/7/28 15:39
加载中...