Cod sursa(job #3000310)
Utilizator | Data | 12 martie 2023 12:09:36 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int n, g, d[10005], w[5005], p[5005];
int main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cin >> n >> g;
for (int i = 1; i <= n; i++)
cin >> w[i] >> p[i];
for (int i = 1; i <= n; i++)
for (int j = g; j >= w[i]; j--)
d[j] = max(d[j], d[j - w[i]] + p[i]);
cout << d[g] << '\n';
return 0;
}