Cod sursa(job #3289915)
| Utilizator | Data | 29 martie 2025 10:31:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
typedef pair<int, int> pi;
const int NMAX = 5001;
const int GMAX = 1e4 + 1;
long long dp[GMAX];
int n, g, w, p;
int main()
{
fin >> n >> g;
for (int i = 1; i <= n; ++i)
{
fin >> w >> p;
for (int j = g; j >= w; --j)
dp[j] = max(dp[j], dp[j - w] + p);
}
fout << dp[g] << '\n';
return 0;
}
