Cod sursa(job #2420420)
| Utilizator | Data | 11 mai 2019 20:50:55 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
std::ifstream fin ("rucsac.in");
std::ofstream fout("rucsac.out");
int n,g;
int v[5050],w[5050];
int d[5050][10500];
int maxx;
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
fin>>w[i]>>v[i];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j>=w[i])
{
d[i][j]=std::max(d[i-1][j], d[i-1][j-w[i]]+v[i]);
if(d[i][j]>maxx)
maxx=d[i][j];
}
else
d[i][j]=d[i-1][j];
}
}
fout<<maxx;
}
