Cod sursa(job #3252754)
| Utilizator | Data | 30 octombrie 2024 21:43:33 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX = 5005, GMAX = 10005;
int w[NMAX], p[NMAX], dp[GMAX];
int32_t main()
{
int n, g;
fin >> n >> g;
for(int i = 1; i <= n; i++)
fin >> 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]);
}
fout << dp[g] << "\n";
fin.close();
fout.close();
return 0;
}
