Cod sursa(job #3284768)
| Utilizator | Data | 12 martie 2025 10:19:17 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
using VI = vector<int>;
int main()
{
int n, G;
fin >> n >> G;
VI dp(G + 1);
int val, greutate;
int ma = 0;
for (int i = 1; i <= n; ++i)
{
fin >> greutate >> val;
for (int i = G; i >= greutate; --i)
{
dp[i] = max(dp[i], dp[i - greutate] + val);
ma = max(dp[i], ma);
}
}
fout << ma;
}
