Cod sursa(job #2214097)
| Utilizator | Data | 18 iunie 2018 13:20:24 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#define MAXN 5010
#define MAXG 10010
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N,G,Pmax;
int W[MAXN],P[MAXN];
int D[2][MAXG];
int main(){
fin>>N>>G;
for(int i=1;i<=N;++i){
fin>>W[i]>>P[i];
}
int l=0;
for(int i=1;i<=N;++i,l=1-l){
for(int j=0;j<=G;++j){
D[1-l][j]=D[l][j];
if(W[i]<=j){
D[1-l][j]=max(D[1-l][j],D[l][j-W[i]]+P[i]);
}
}
}
Pmax=D[l][G];
fout << Pmax;
return 0;
}
