Cod sursa(job #1956847)
Utilizator | Data | 7 aprilie 2017 08:57:57 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
int w[10001], p[10001], Cost[10001], g, n;
int main(){
ofstream fout("rucsac.out");
ifstream fin("rucsac.in");
fin>>n;
fin>>g;
for(int i=1; i<=n; i++){
cin>>w[i];
cin>>p[i];}
for(int i=0; i<=n; i++){
for(int j=g; j>=w[i]; j--){
Cost[j]=max(Cost[j], Cost[j-w[i]]+p[i]);
}
}
fout<<Cost[g];
return(0);
}