Cod sursa(job #2428569)
Utilizator | Stafie Ciprian Mihai alcholistu | Data | 5 iunie 2019 19:55:01 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int el[5000], val[5000], optim[10001];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G, i, j;
f >> n >> G;
for (i=0;i<n;i++)
f >> el[i]>> val[i];
for (i=0;i<n;i++)
for (j=G-el[i];j>=0;j--)
if (optim[j+el[i]] < optim[j]+val[i])
optim[j+el[i]] = optim[j]+val[i];
g << optim[G];
f.close(), g.close();
return 0;
}