Pagini recente » Cod sursa (job #522149) | Cod sursa (job #2031583) | Cod sursa (job #2897658) | Cod sursa (job #522126) | Cod sursa (job #2645776)
#include <fstream>
using namespace std;
ifstream cin("data.in");
ofstream cout("data.out");
const int NMAX=10000;
int d[NMAX+5];
int main()
{
int n,G,i,j,last,g,p,maxp=0;
cin>>n>>G;
for(i=1;i<=G;i++)
d[i]=-1;
last=0;
for(i=1;i<=n;i++)
{
cin>>g>>p;
for(j=last;j>=0;j--)
{
if(j+g>G)continue;
if(d[j]!=-1)
{
///Se formeaza suma j+g
///d[j+g] este profitul maxim acual al sumei j+g
if(d[j+g]<d[j]+p)
{
d[j+g]=d[j]+p;
if(j+g>last)
last=j+g;
}
}
}
}
for(i=1;i<=G;i++)
{
if(d[i]>maxp)
maxp=d[i];
}
cout<<maxp;
return 0;
}