Cod sursa(job #1930621)
Utilizator | Data | 19 martie 2017 08:05:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int s[10001];
int main()
{ int n,gmax,Max=0,i,j,w,c;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>gmax;
for (i=1;i<=n;++i) {
f>>w>>c;
for (j=gmax;j>=w;--j) {
s[j]=max(s[j],s[j-w]+c);
Max=max(s[j],Max);
}
}
g<<Max<<"\n";
return 0;
}