Cod sursa(job #1380138)
Utilizator | Ovidiu Giorgi pulse | Data | 6 martie 2015 22:18:29 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5010;
const int MAXG = 10010;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, dp[2][MAXG], l;
int p[MAXN], w[MAXN];
int main()
{
fin >> n >> g;
for (int i = 1; i <= n; ++i)
{
fin >> w[i] >> p[i];
}
l = 1;
for (int i = 1; i <= n; ++i)
{
for (int cw = 0; cw <= g; cw++)
{
dp[l][cw] = dp[1 - l][cw];
if (w[i] <= cw)
dp[l][cw] = max(dp[l][cw], dp[1 - l][cw - w[i]] + p[i]);
}
l = 1 - l;
}
fout << dp[1 - l][g];
return 0;
}