Cod sursa(job #1950824)
Utilizator | Data | 3 aprilie 2017 12:06:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
int w[10000], p[10000], d[10000], g, n;
int main(){
ofstream cout("rucsac.out");
ifstream cin("rucsac.in");
cin>>n;
cin>>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--){
d[j]=max(d[j], d[j-w[i]]+p[i]);
}
}
cout<<d[g];
return 0;
}