Cod sursa(job #2420008)
Utilizator | Data | 10 mai 2019 09:14:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out("rucsac.out");
int n, g, w[5010], p[5010], i, j, k, d[10010];
int main()
{
in>>n>>g;
for(i=1; i<=n; i++)
for(i=1; i<=n; i++)
{in>>w[i]>>p[i];
for(j=g; j>=1; j--)
if(j-w[i]>=0) d[j]=max(d[j], d[j-w[i]]+p[i]);}
out<<d[g]<<'\n';
return 0;
}