Cod sursa(job #2286347)
| Utilizator | Data | 20 noiembrie 2018 10:20:27 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define NMAX 5005
#define GMAX 10005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G;
int g[NMAX],c[NMAX],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>=1;x--)
if(x-g[i]>=0)
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;
}
