Pagini recente » Cod sursa (job #2705149) | Cod sursa (job #2041594) | Cod sursa (job #2437707) | Cod sursa (job #2187522) | Cod sursa (job #1916276)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,g[50001],p[50001],d[50001],j,i,ans;
int main()
{
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>g[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=G;j>g[i];j--)
if(d[j-g[i]])d[j]=max(d[j-g[i]]+p[i],d[j]);
d[g[i]]=max(d[g[i]],p[i]);
}
for(i=1;i<=G;i++)
ans=max(ans,d[i]);
fout<<ans;
return 0;
}