Cod sursa(job #2882966)
Utilizator | Data | 31 martie 2022 23:40:44 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,g1,gr,i,j,greu[10001],p[10001],mx,pu;
int main()
{
f >> n >> g1;
for (i = 1; i <= n; i ++)
{
f >> gr >> pu;
for (j = g1 - gr; j >= 0; j --)
{
if(greu[j] == 1)
{
greu[j + gr]=1;
p[j + gr] = max(p[j + gr], p[j] + pu);
mx = max(mx, p[j + gr]);
}
}
}
g << mx;
return 0;
}