Pagini recente » Cod sursa (job #1842505) | Cod sursa (job #1090739) | Cod sursa (job #2311391) | Cod sursa (job #3125450) | Cod sursa (job #2175907)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, G, greu, profit, v[10001],maxi=-999999999;
int main()
{
fin>>n>>G;
for(int i=1;i<=n;i++)
{fin>>greu>>profit;
for(int i=G;i>=0;i--)
{
if((v[i]!=0 && i+greu<=G)|| i==0)
{
v[i+greu]=max(v[i+greu], v[i]+profit);
}
if(v[i+greu]>maxi)
maxi=v[i+greu];
}
}
fout<<maxi;
//for(int i=0;i<=G;i++)
// cout<<v[i]<<" ";
return 0;
}