Cod sursa(job #3230100)
| Utilizator | Data | 19 mai 2024 11:30:35 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, dp[20010], i, j;
pair<int, int> a;
int main()
{
in >> n >> g;
for (i = 1; i <= n; i++)
{
in >> a.first >> a.second;
for (j = g; j >= 1; j--)
{
if (a.first <= j)
dp[j] = max(dp[j], dp[j - a.first] + a.second);
}
}
out << dp[g];
return 0;
}