Pagini recente » Cod sursa (job #1562736) | Cod sursa (job #1174184) | Cod sursa (job #2371424) | Cod sursa (job #824967) | Cod sursa (job #3138386)
#include <fstream>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int M[5001][10001],gr[5001],pr[5001],G,n,k;
int main()
{
cin>>n>>G;
for (int i=1; i<=n; ++i)
{
int x,y;
cin>>x>>y;
gr[i]=x;
pr[i]=y;
}
for (int i=1; i<=n; ++i)
for (int j=1; j<=G; ++j)
{
if (j>=gr[i])M[i][j]=max(M[i-1][j],M[i-1][j-gr[i]]+pr[i]);
else M[i][j]=M[i-1][j];
}
for (int i=1; i<=n; ++i, cout<<endl)
for (int j=1; j<=G; ++j)
cout<<M[i][j]<<" ";
return 0;
}
/*
3 7
3 4
1 2
1 9
2 4
*/