Cod sursa(job #2493523)
| Utilizator | Data | 16 noiembrie 2019 13:33:07 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int D[1000][1000],N,G,W[1000],P[1000];
void citire ()
{
fin>>N>>G;
for(int i=1; i<=N; i++)
fin>>W[i]>>P[i];
}
void rezolvare ()
{
for(int i=1; i<=N; i++)
for(int j=0; j<=G; j++)
{
if(j-W[i]>=0)
D[i][j]=max(D[i-1][j],D[i-1][j-W[i]]+P[i]);
else
D[i][j]=D[i-1][j];
}
}
int main()
{
citire();
rezolvare();
fout<<D[N][G];
}
