Cod sursa(job #1686242)
Utilizator | Data | 12 aprilie 2016 09:55:54 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
using namespace std;ifstream f("rucsac.in");ofstream g("rucsac.out");int m[2][10005],j,n,G,w,p;int main(){f>>n>>G;while(n--){f>>w>>p;for(j=1;j<=G;j++)if(w<=j)m[n%2][j]=max(m[!(n%2)][j],m[!(n%2)][j-w]+p);else m[n%2][j]=m[!(n%2)][j];}g<<m[0][G];}