Pagini recente » Cod sursa (job #1795957) | Cod sursa (job #50285) | Cod sursa (job #2183824) | Cod sursa (job #1493036) | Cod sursa (job #1775541)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int d[3][100001],n,gg,w[5001],p[5001];
void sw()
{
int i;
for(i=0;i<=gg;i++)
d[1][i]=d[2][i];
}
int i,j;
int main()
{
f>>n>>gg;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=0;j<=gg;j++)
{
if(w[i]<=j)d[2][j]=max(d[1][j],d[1][j-w[i]]+p[i]);
else d[2][j]=d[1][j];
}
sw();
}
g<<d[2][gg];
return 0;
}