Cod sursa(job #3315315)
| Utilizator | Data | 13 octombrie 2025 19:59:08 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
vector <int> w, p, r;
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g;
cin >> n >> g;
w.resize(n);
p.resize(n);
r.resize(g+1);
for(int i=0; i<n; i++)
{
cin >> w[i] >> p[i];
}
for(int i=0; i<n; i++)
{
for(int j=g; j>=w[i]; j--)
{
r[j]=max(r[j], r[j-w[i]]+p[i]);
}
}
cout << r[g];
return 0;
}