Cod sursa(job #3262935)
| Utilizator | Data | 12 decembrie 2024 11:55:50 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int dp[2][10000];
struct elem
{
int greutate, profit;
};
elem v[10009];
signed main ()
{
int n, g1, i, j;
f >> n >> g1;
for (i=1; i<=n; i++)
f >> v[i].greutate >> v[i].profit;
for (i=1; i<=n; i++)
{
for (j=v[i].greutate; j<=g1; j++)
dp[1][j]=max(dp[0][j], dp[0][j-v[i].greutate]+v[i].profit);
for (j=1; j<=g1; j++)
dp[0][j]=dp[1][j];
}
g << dp[1][g1];
}
