Cod sursa(job #3287004)
| Utilizator | Data | 14 martie 2025 22:06:07 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 10000;
int w[MAX], p[MAX], dp[MAX];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, G;
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)
{
dp[j] = max(dp[j], dp[j-w[i]]+p[i]);
}
}
cout << dp[G];
return 0;
}
