Cod sursa(job #2290887)
Utilizator | Data | 27 noiembrie 2018 09:49:14 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#define GMAX 10002
#define NMAX 5004
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G;
int g[NMAX];
int c[NMAX];
int cmax[GMAX];
void citire()
{
int i;
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>g[i]>>c[i];
}
void pd()
{
int i,x;
for(i=1;i<=n;i++)
for(x=G;x>0;x--)
if(x>=g[i])
if(cmax[x]<c[i]+cmax[x-g[i]])
cmax[x]=c[i]+cmax[x-g[i]];
}
int main()
{
citire();
pd();
fout<<cmax[G]<<'\n';
return 0;
}