Pagini recente » Cod sursa (job #39524) | Cod sursa (job #1032050) | Cod sursa (job #218916) | Cod sursa (job #419722) | Cod sursa (job #2828547)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,t,i,j,c[5005][10005],p[5005],m[10005],mx;
int main()
{
cin>>n>>t;
for(i=1; i<=n; i++)
cin>>m[i]>>p[i];
for(i=1; i<=n; i++)
for(j=1; j<=t; j++)
{
if(j-m[i]>=0) c[i][j]=max(p[i]+c[i-1][j-m[i]],c[i-1][j]);
else c[i][j]=c[i-1][j];
}
for(i=1;i<=t;i++)
mx=max(mx,c[n][i]);
cout<<mx;
return 0;
}