Cod sursa(job #1799995)
Utilizator | Data | 7 noiembrie 2016 09:47:41 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in"); ofstream g("rucsac.out");
int N,G,P,W,D[10010];
int main()
{ f>>N>>G;
for(int i=1;i<=N;++i)
{ f>>W>>P;
for(int j=G;j>=W; --j) D[j]=max(D[j], D[j-W]+P);
}
g<<D[G]<<'\n'; g.close(); return 0;
}