Pagini recente » Cod sursa (job #1874735) | Cod sursa (job #2872830) | Cod sursa (job #2923359) | Istoria paginii propuneri/14-grupuri-probleme | Cod sursa (job #1012862)
#include <cstdio>
#include <array>
#include <deque>
#define Max(a,b) ((a)>(b)?(a):(b))
using namespace std;
int n,i,gmax,obs,m[5000],p[5000];
deque<array<int,10001>>a;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&gmax);
for (i=0;i<n;i++)
scanf("%d%d",&m[i],&p[i]);
obs=0;
while (obs<n)
{
a.resize(2);
a[1][0]=0;
for (i=1;i<m[obs];i++)
a[1][i]=a[0][i];
for (;i<=gmax;i++)
a[1][i]=Max(a[0][i],p[obs]+a[0][i-m[obs]]);
obs++;
a.pop_front();
}
printf("%d\n",a[0][gmax]);
return 0;
}