Cod sursa(job #2371382)
| Utilizator | Data | 6 martie 2019 17:24:29 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define nmax 5005
#define gmax 10005
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, a[nmax][gmax],G, cst[nmax], gr[nmax];
void citire()
{
int i;
f>>n>>G;
for(i=1; i<=n; i++)
{
f>>gr[i]>>cst[i];
}
}
void rucsac()
{
int i,j;
for(i=1; i<=n; i++)
for(j=0; j<=G; j++)
{
a[i][j]=a[i-1][j];
if(gr[i]<=j)
a[i][j]=max(a[i][j], a[i-1][j-gr[i]]+cst[i]);
}
}
int main()
{
citire();
rucsac();
g<<a[n][G];
f.close();
g.close();
return 0;
}
