Pagini recente » Cod sursa (job #510097) | Cod sursa (job #1829595) | Cod sursa (job #661384) | Cod sursa (job #237726) | Cod sursa (job #1524258)
#include<fstream>
using namespace std;
long n,i,d[10001],w[5001],p[5001],j,G;
long maxim(long a, long b)
{
if(a>b)
return a;
return b;
}
int main()
{
ifstream f("energii.in");
ofstream g("energii.out");
f>>n>>G;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=w[1];i<=G;i++)
d[i]=p[1];
for(i=2;i<=n;i++)
for(j=G;j>=w[i];j--)
{
d[j]=maxim(d[j], d[j-w[i]]+p[i]);
}
g<<d[G];
return 0;
}