Pagini recente » Cod sursa (job #137497) | Cod sursa (job #1943199) | Cod sursa (job #3171163) | Cod sursa (job #2199474) | Cod sursa (job #2373326)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,w1,q1;
int a[50005];
int main()
{
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>w1>>q1;
for(int j=g;j>=0;j--)
{
if(j==w1 || (j-w1>0 && a[j-w1]!=0))
{
a[j]=max(a[j],a[j-w1]+q1);
}
}
}
int maxim=0;
for(int i=0;i<=g;i++)
{
maxim=max(maxim,a[i]);
}
out<<maxim;
return 0;
}