Cod sursa(job #3245784)
Utilizator | Data | 30 septembrie 2024 17:10:54 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int dp[10005], w[5005], p[5005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, G;
cin >> n >> G;
for (int i = 1; i <= n; ++i)
{
int g, v;
cin >> g >> v;
for (int j = G; j >= g; --j)
dp[j] = max(dp[j], dp[j-g]+v);
}
cout << dp[G];
return 0;
}