Cod sursa(job #2251762)
Utilizator | Data | 1 octombrie 2018 22:14:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
using namespace std;
int n,Gmax,G,V,i,j,pd[3][100001],W[1001],P[1001],ans,act,ant;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
cin>>n>>Gmax;
for(i=1; i<=n; i++)
{
cin>>G>>V;
W[i]=G;
P[i]=V;
}
for(i=1; i<=n; i++)
{
act=i%2;
ant=1-(i%2);
for(j=1; j<W[i]; j++)
pd[act][j]=pd[ant][j];
for(j=W[i]; j<=Gmax; j++)
pd[act][j]=max(pd[ant][j],pd[ant][j-W[i]]+P[i]);
}
ans=0;
for(i=1;i<=Gmax;i++)
ans=max(ans,pd[n][Gmax]);
cout<<ans<<'\n';
return 0;
}