Cod sursa(job #2174575)
Utilizator | Data | 16 martie 2018 12:37:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,i,j,d[3][10010],w[5010],p[5010];
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=0;j<=G;j++)
{
if(j>=w[i]){d[2][j]=max(d[1][j],d[1][j-w[i]]+p[i]);}
else d[2][j]=d[1][j];
}
for(j=0;j<=G;j++)
d[1][j]=d[2][j];
}
g<<d[2][G];
return 0;
}