Cod sursa(job #2150438)
| Utilizator | Data | 3 martie 2018 15:56:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n,g,ma[5005][5005],cost[5005],val[5005];
int main()
{
int i,j;
in>>n>>g;
for(i=1;i<=n;i++)
in>>cost[i]>>val[i];
for(i=1;i<=n;i++)
for(j=1;j<=g;j++)
{
if(cost[i]<=j)
ma[i][j]=max(val[i]+ma[i-1][j-cost[i]],ma[i-1][j]);
else
ma[i][j]=ma[i-1][j];
}
out<<ma[n][g];
return 0;
}
