Cod sursa(job #2208162)
Utilizator | Data | 28 mai 2018 14:30:55 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N, G, pret[5005], g[5005], d[10005], i, j;
int main()
{
fin>>N>>G;
for(i=0;i<N;i++)
fin>>g[i]>>pret[i];
for (i=0;i<N;i++)
for (j=G;j>=g[i];j--)
d[j]=max(d[j-g[i]]+pret[i],d[j]);
fout<<d[G];
return 0;
}