Cod sursa(job #3212863)
Utilizator | Rebeca N bexx | Data | 12 martie 2024 11:26:02 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,g,w[5002],p[5002],d[2][10002];
int main()
{
cin>>n>>g;
for(int i=1;i<=n;i++)
cin>>w[i]>>p[i];
int linie=0;
for(int i=1;i<=n;i++)
{
linie=1-linie;
for(int j=1;j<=g;j++)
{
d[linie][j]=d[1-linie][j];
if(w[i]<=j)
d[linie][j]=max(d[linie][j],d[1-linie][j-w[i]]+p[i]);
}
}
cout<<d[linie][g];
return 0;
}