Cod sursa(job #3346144)
| Utilizator | Data | 12 martie 2026 17:49:18 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, G;
int dp[10005];
int main()
{
cin>>n>>G;
for (int i = 1; i<=n; ++i)
{
int w, p;
cin>>w>>p;
for (int j = G; j >= w; --j)
dp[j] = max(dp[j], dp[j - w] + p);
}
int maxim = 0;
for (int i = 0; i<=G; ++i)
maxim = max(maxim, dp[i]);
cout<<maxim;
}
