Pagini recente » Cod sursa (job #572646) | Cod sursa (job #577949) | Cod sursa (job #2471381) | Cod sursa (job #763384) | Cod sursa (job #2375044)
#include <iostream>
using namespace std;
#define INF 9999999
struct inf
{
int p,g;
}v[5005];
int g,n,dp[5005];
void read()
{
int i;
cin>>n>>g;
for(i=1;i<=n;i++)
{
cin>>v[i].g>>v[i].p;
}
}
void solve()
{
int i,j,sol;
for(i=1;i<=g;i++)
dp[i]=INF;
for(i=1;i<=n;i++)
for(j=g;j>=0;j--)
{
if(dp[j]!=INF)
{
if(dp[j+v[i].g]==INF) dp[j+v[i].g]=dp[j]+v[i].p;
else
dp[j+v[i].g]=max(dp[j+v[i].g],dp[j]+v[i].p);
}
}
sol=0;
for(i=1;i<=g;i++)
if(dp[i]!=INF) sol=max(sol,dp[i]);
cout<<sol;
}
int main()
{
read();
solve();
return 0;
}