Cod sursa(job #1441905)
Utilizator | Data | 24 mai 2015 13:26:30 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
const int MAX_N = 5003;
const int MAX_G = 10004;
int i,j,n,gmax,g[MAX_N],cost[MAX_N],d[MAX_G];
int main(){
fi>>n>>gmax;
for(i=1;i<=n;i++) fi>>g[i]>>cost[i];
for(i=1;i<=n;i++)
for(j=gmax;j>=g[i];j--){
d[j]=max(d[j],d[j-g[i]]+cost[i]);
}
fo<<d[gmax];
fi.close();
fo.close();
return 0;
}