Pagini recente » Cod sursa (job #2206409) | Cod sursa (job #2794663) | Cod sursa (job #2633381) | Cod sursa (job #1819729) | Cod sursa (job #2433996)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
long long int g[10009];
int main()
{
long long int n,G,i,p,j,w,maxi=0;
fin>>n>>G;
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=G;j>=0;j--)
{if(g[j] && (j+w<=G) && g[j+w]<g[j]+p)
g[j+w]=g[j]+p;
if(j==w && p>g[w]) g[w]=p;
}
}
for(i=0;i<=G;i++)if(g[i]>maxi) maxi=g[i];
fout<<maxi;
return 0;
}