Pagini recente » Cod sursa (job #1107704) | Cod sursa (job #2972228) | Cod sursa (job #292397) | Cod sursa (job #2379172) | Cod sursa (job #1235227)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int c[10005], g[10005], a[10005], gmax, i, j, n, rs;
int main()
{
cin>>n>>gmax;
for (i=1; i<=n; ++i)
cin>>g[i]>>c[i];
a[0]=0; rs=0;
for (j=1; j<=n; ++j)
for (i=gmax; i-g[j]>=0; --i)
if (a[i]<a[i-g[j]]+c[j])
{
a[i]=a[i-g[j]]+c[j];
rs=max(rs, a[i]);
}
cout<<rs;
return 0;
}