Mai intai trebuie sa te autentifici.
Cod sursa(job #1097249)
Utilizator | Data | 3 februarie 2014 11:30:30 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.86 kb |
#include <fstream>
#define GMAX 10010
#define NMAX 5004
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
void citire();
void pd();
void afisare();
int G,n,lcrt=2,lprec=1;
int gr[NMAX],p[NMAX];
int pmax[3][NMAX];
int maxim;
int main()
{
citire();
pd();
afisare();
return 0;
}
void pd()
{
int i,j;
//for (i=1;i<=n;i++) pmax[i][0]=0;
for (i=1;i<=G;i++)
if (gr[1]<=i) pmax[1][i]=p[1];
for (i=2;i<=n;i++)
{for (j=1;j<=G;j++)
{
maxim=pmax[lprec][j];
if (gr[i]<=j && maxim<p[i]+pmax[lprec][j-gr[i]])
maxim=p[i]+pmax[lprec][j-gr[i]];
pmax[lcrt][j]=maxim;
}
lcrt=3-lcrt; lprec=3-lprec;
}
}
void afisare()
{
fout<<maxim<<'\n';
}
void citire()
{
int i;
fin>>n>>G;
for (i=1;i<=n;i++)
fin>>gr[i]>>p[i];
}