动态规划

#include <cstdio>
#include <cstring>
#include <algorithm>


using namespace std;


int bag[3407][12890];
int weight[3407];
int value[3407];
int main()
{
memset(bag,0,sizeof(bag));
int n ,m;
scanf("%d %d",&n,&m);
for(int i = 1;i<=n;i++)
{
scanf("%d %d",&weight[i],&value[i]);
}

for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=m;j++)
{
if(weight[i]<=j)
{
bag[i][j] = max(bag[i-1][j-weight[i]]+value[i],bag[i-1][j]);
}
else
{
bag[i][j] = bag[i-1][j];
}
}
}
printf("%d",bag[n][m]);

}

#include <cstdio>
#include <cstring>
#include <algorithm>


using namespace std;


int bag[12890];
int weight[3407];
int value[3407];
int main()
{
memset(bag,0,sizeof(bag));
int n ,m;
scanf("%d %d",&n,&m);
for(int i = 1;i<=n;i++)
{
scanf("%d %d",&weight[i],&value[i]);
}

for(int i = 1;i<=n;i++)
{
for(int j = m;j>=0;j--)
{
if(weight[i]<=j)
{
bag[j] = max(bag[j],bag[j-weight[i]]+value[i]);
//printf("bag[%d] = %d\n",j,bag[j]);
}
else
{
bag[j] = bag[j];
}
}
}
printf("%d",bag[m]);
}