Pagini recente » Cod sursa (job #2448380) | Cod sursa (job #876773) | Cod sursa (job #98327) | Cod sursa (job #2344167) | Cod sursa (job #1639480)
#include <iostream>
#define NMAX 100005
using namespace std;
int n,T,i,Max,j;
int G[NMAX],C[NMAX],v[NMAX];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&T);
for(i=1;i<=n;++i)
scanf("%d%d",&G[i],&C[i]);
Max=0;
for(i=1;i<=n;++i)
{
for(j=T-G[i];j>=0;--j)
{
if(v[j+G[i]] < v[j] + C[i])
{
v[j+G[i]]=v[j]+C[i];
if(v[j+G[i]] > Max) Max=v[j+G[i]];
}
}
}
printf("%d\n",Max);
return 0;
}