Cod sursa(job #877737)
| Utilizator | Data | 13 februarie 2013 09:23:09 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int w[5010],p[5010];
int n,G,i,cw,d[2][10010],l,pmax;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
l=0;
for(i=1;i<=n;i++,l=1-l)
for(cw=0;cw<=G;cw++)
{
d[1-l][cw]=d[l][cw];
if(w[i]<=cw)
d[1-l][cw]=max(d[1-l][cw],d[l][cw-w[i]]+p[i]);
}
pmax=d[l][G];
g<<pmax<<"\n";
return 0;
}
