Cod sursa(job #3000311)
Utilizator | Data | 12 martie 2023 12:11:08 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, d[10002], w, p;
int main()
{
fin >> n >> g;
for (int i = 1; i <= n; i++)
{
fin >> w >> p;
for (int j = g; j >= w; j--)
d[j] = max(d[j], d[j - w] + p);
}
fout << d[g];
return 0;
}