Cod sursa(job #1368528)
Utilizator | Alex Bercea Alex1199 | Data | 2 martie 2015 18:22:50 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int64_t n, w, m[5009],c[10009], V[2][10009];
int main()
{
f>>n>>w;
for(int64_t i=1;i<=n;i++)
{f>>m[i]>>c[i];}
for(int64_t i=1;i<=n;i++)
{
for(int64_t j=1;j<=w;j++)
{
if(j<m[i]) V[1][j]=V[0][j];
else V[1][j]=max(V[0][j],V[0][j-m[i]]+c[i]);
}
for(int64_t j=1;j<=w;j++)
{
V[0][j]=V[1][j]; V[1][j]=0;
}
}
g<<V[0][w];
return 0;
}