Cod sursa(job #1772863)
| Utilizator | Data | 7 octombrie 2016 09:10:22 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,D[5001][10001],p[5001],w[5001];
int main()
{
in>>n>>g;
for(int i=1;i<=n;++i)in>>w[i]>>p[i];
for(int i=1;i<=n;++i)
{
for(int cw=1;cw<=g;++cw)
{
D[2][cw]=D[1][cw];
if(w[2]<=cw)
{
D[2][cw]=max(D[2][cw],D[1][cw-w[i]]+p[i]);
}
}
for(int cw=1;cw<=g;++cw)
{
D[1][cw]=D[2][cw];
}
}
out<<D[2][g];
return 0;
}
