Cod sursa(job #658778)
Utilizator | Data | 9 ianuarie 2012 15:59:03 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define M 10010
using namespace std;
ifstream f("rucsac.in");
ofstream gg("rucsac.out");
int gr[M],a[M],g,G,i,j,n,pr[M],p;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++){f>>g>>p;
for(j=M-g;j>=1;j--) if(a[j]>0) a[j+g]=max(a[j+g],a[j]+p);
a[g]=max(a[g],p);
}
gg<<a[G]<<'\n';
f.close();gg.close();
return 0;
}