Cod sursa(job #3245783)
| Utilizator | Data | 30 septembrie 2024 17:09:37 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int dp[5005], w[10005], p[10005];
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);
}
int ans = 0;
for (int i = 0; i <= G; ++i)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}
