```cpp
#include<bits/stdc++.h>
using namespace std;
int w[105], val[105];
int dp[1005];
int main()
{
int t,m,res=-1;
scanf("%d%d",&t,&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&w[i],&val[i]);
}
for(int i=1;i<=m;i++)
{
for(int j=t;j>=0;j--)
{
if(j>=w[i])
{
dp[j]=max(dp[j-w[i]]+val[i], dp[j]);
}
}
}
printf("%d",dp[t]);
return 0;
}
``````
by safdsfdeaf @ 2024-04-05 20:05:42
@[safdsfdeaf](/user/1089206) 我又不是看不到题解，你给我复制过来干嘛……
by ONicklgzh @ 2024-04-06 13:38:35
第二重循环应该倒着循环
by feng_qi @ 2024-04-07 19:41:29