Cod sursa(job #874432)
| Utilizator | Data | 8 februarie 2013 14:08:03 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,G,g[5050],v[10010],fin[2][1010], i, j,l;
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>G;
for(i=1;i<=n;i++)
{
f>>g[i]>>v[i];
}
for(i=1;i<=n;i++,l=1-l)
{
for(j=1;j<=G;j++)
{
fin[1-l][j]=fin[l][j];
if(g[i]<=j)
{
fin[1-l][j]=max(fin[1-l][j],fin[l][j-g[i]]+v[i]);
}
}
}
g<<fin[l][G];
return 0;
}
