Cod sursa(job #2882962)
Utilizator | Data | 31 martie 2022 23:32:49 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, i, j, G, mx = 0,P[100001], W[100001], a[100001];
int main()
{
cin >> n >> G;
for (i = 1; i <= n; i++)
cin >> W[i] >> P[i];
for (i = 1; i <= n; i++)
{
for (j = G; j >= W[i]; j--)
if (a[j] < a[j - W[i]] + P[i])
{
a[j] = a[j - W[i]] + P[i];
if (a[j] > mx)
mx = a[j];
}
}
cout << mx << "\n";
return 0;
}