Cod sursa(job #1412070)
| Utilizator | Data | 1 aprilie 2015 09:08:50 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream m("rucsac.out");
int g,p,d[2][10005],i,n,w,j,r;
int main()
{
f>>n>>g;
for(i=0;i<=1;i++)
for(j=0;j<=g;j++)
d[i][j]=0;
for(i=1;i<=n;i++)
{
f>>w>>p;
for(j=1;j<=g;j++)
{
if(i%2==0)
d[0][j]=d[1][j];
else
d[1][j]=d[0][j];
if(j>=w && i%2==0)
d[0][j]=max(d[0][j],d[1][j-w]+p);
if(j>=w && i%2==1)
d[1][j]=max(d[1][j],d[0][j-w]+p);
}
// m<<
}
r=max(d[1][g],d[0][g]);
m<<r;
return 0;
}
