Cod sursa(job #1586865)
Utilizator | Data | 1 februarie 2016 18:07:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int n,g;
int w,p;
int i,j,lc,lp;
int c[2][10001];
int main()
{
fi>>n>>g;
lc=1;lp=0;
for (i=1;i<=n;i++,swap(lc,lp))
{ fi>>w>>p;
for (j=0;j<=g;j++)
if (w<=j) c[lc][j]=max(c[lp][j],c[lp][j-w]+p);
}
fo<<c[lp][g];
return 0;
}