Cod sursa(job #1941425)
Utilizator | Data | 27 martie 2017 11:53:03 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ofstream fout("rucsac.out");
ifstream fin("rucsac.in");
int w[10000], p[10000], d[10000], g, n;
int main(){
fin>>n;
fin>>g;
for(int i=1; i<=n; i++){
fin>>w[i];
fin>>p[i];
}
for(int i=0; i<=n; i++){
for(int j=g; j>=w[i]; j--){
d[j]=max(d[j], d[j-w[i]]+p[i]);
}
}
fout<<d[g];
return 0;
}