Pagini recente » Clasament preoni5b | Cod sursa (job #852936) | Cod sursa (job #2221082) | Cod sursa (job #1127708) | Cod sursa (job #3039384)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
struct obiect {
int w, p;
} o[5005];
int n, g, dp[5005][10005];
int main()
{
in >> n >> g;
for (int i = 1; i <= n; i++) {
in >> o[i].w >> o[i].p;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < o[i].w; j++)
dp[i][j] = dp[i - 1][j];
for (int j = o[i].w; j <= g; j++)
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - o[i].w] + o[i].p);
}
out << dp[n][g];
return 0;
}