Cod sursa(job #2164828)
| Utilizator | Data | 13 martie 2018 09:58:33 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream gout("rucsac.out");
int n,g[10001],v[10001],r[10001][10001],Gmax;
void citire()
{
f>>n>>Gmax;
for(int i=1;i<=n;i++)
f>>g[i]>>v[i];
}
int main()
{
citire();
///r[i][j]=valoarea maxima obtinuta din obiectele 1..i
///intr-un rucsac cu capacitatea maxima j
for(int i=1;i<=n;i++)
for(int j=0;j<=Gmax;j++)
if(g[i]>j)r[i][j]=r[i-1][j];
else r[i][j]=max(r[i-1][j],v[i]+r[i-1][j-g[i]]);
gout<<r[n][Gmax];
return 0;
}
