Cod sursa(job #903173)
Utilizator | Data | 1 martie 2013 18:55:31 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#define NMAX 50005
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int N,G,gg,w;
int D[NMAX];
int main()
{
f>>N>>G;
for(int i(1); i <= N ; ++i )
{
f>>gg>>w;
for(int j=G; j >= gg ; ++j )
D[j]=max(D[j],D[j-gg]+w);
}
g<<D[G];
f.close();
g.close();
return 0;
}