Cod sursa(job #2035363)
| Utilizator | Data | 9 octombrie 2017 11:37:24 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#define NMAX 10005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
int dp[5][NMAX];
int main()
{
fin >> n >> g;
for (int i = 1; i <= n; i++)
{
int w, p;
fin >> w >> p;
for (int j = 1; j <= g; j++)
{
if (j >= w)
dp[i % 2][j] = max(dp[1 - i % 2][j], dp[1 - i % 2][j - w] + p);
else dp[i % 2][j] = dp[1 - i % 2][j];
}
}
fout << dp[n % 2][g];
return 0;
}
