Pagini recente » Cod sursa (job #2717766) | Cod sursa (job #2926244) | Cod sursa (job #3127939) | Cod sursa (job #2301848) | Cod sursa (job #1284096)
#include <iostream>
#include <fstream>
using namespace std;
int a[100][100];
int w[100][3];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,i,j,g;
fin>>n>>G;
for(i=1; i<=n; i++)
{
for(j=1; j<=2; j++)
fin>>w[i][j];
}
for(i=1; i<=n; i++)
{
for(g=1; g<=G+1; g++)
{
if(w[i][1]<g)
a[i][g]=max(w[i][2]+a[i-1][g-w[i][1]],a[i-1][g]);
else a[i][g]=a[i-1][g];
}
}
/*
for(i=1; i<=n; i++)
{
for(g=1; g<=G+1; g++)
cout<<a[i][g]<<" ";
cout<<"\n";
}*/
fout<<a[n][G+1];
return 0;
}