Pagini recente » Cod sursa (job #2905381) | Cod sursa (job #648248) | Cod sursa (job #2909665) | Cod sursa (job #2944777) | Cod sursa (job #2507483)
#include <bits/stdc++.h>
#define nmax 10005
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int dp[nmax / 2][nmax], n, g, gr[nmax], p[nmax], pmax;
int main()
{
fin >> n >> g;
for (int i = 1; i <= n; i++)
{
fin >> gr[i] >> p[i];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= g; j++)
dp[1][j] = dp[2][j];
for (int j = 1; j <= g; j++)
{
if ((j - gr[i]) >= 0)
{
dp[2][j] = max(dp[1][j], dp[1][j - gr[i]] + p[i]);
}
else dp[2][j] = dp[1][j];
}
}
fout << dp[2][g];
return 0;
}