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