Pagini recente » Cod sursa (job #2884300) | Cod sursa (job #2588074) | Cod sursa (job #388479) | Cod sursa (job #923993) | Cod sursa (job #2879098)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,g1,i,cw,max1,gr1,pr1;
int gr[5001],pr[5001],r[10001];
int main()
{
f>>n>>g1;
for(i=1;i<=n;i++)
f>>gr[i]>>pr[i];
for(i=1;i<=n;i++)
{
gr1=gr[i];
pr1=pr[i];
for(cw=g1;cw>=0;cw--)
{
if(gr1<=cw)
r[cw] = max(r[cw], r[cw-gr1]+pr1);
}
}
for(i=0;i<=g1;i++)
if(r[i]>max1)
max1=r[i];
g<<max1;
return 0;
}