Cod sursa(job #3173823)
Utilizator | Data | 23 noiembrie 2023 19:17:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#define maxim 10002
using namespace std;
int n, g, d[maxim] , w, p;
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
cin >> n >> g;
for (int i = 1; i <= n; i++)
{
cin >> w >> p;
for (int j = g; j >= w; j--)
{
d[j] = max(d[j], d[j - w] + p);
}
}
cout << d[g];
return 0;
}