Cod sursa(job #3039171)
Utilizator | Data | 28 martie 2023 11:33:00 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int w[5001], p[5001], dp[10001];
int n, g;
int main (void)
{
in >> n >> g;
for (int i = 0; i < n; i++)
in >> w[i] >> p[i];
for (int i = 0; i < n; i++)
for (int j = g; j >= w[i]; j--)
dp[j] = max (dp[j], p[i] + dp[j - w[i]]);
out << dp[g];
}