Pagini recente » Cod sursa (job #645386) | Cod sursa (job #2492909) | Cod sursa (job #2770630) | Cod sursa (job #779156) | Cod sursa (job #1618903)
#include <fstream>
using namespace std;
int d1[10001],d2[10001];
int gr[5001],c[5001];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gre,i,j;
f>>n>>gre;
for(i=1;i<=n;i+=1)
{
f>>gr[i]>>c[i];
}
for(i=1;i<=n;i+=1)
{
for(j=1;j<=gre;j+=1)
{
d2[j]=d1[j];
if(gr[i]<=j)
{
d2[j]=max(d2[j],d1[j-gr[i]]+c[i]);
}
}
for(j=1;j<=gre;j+=1)
d1[j]=d2[j];
}
g<<d2[gre];
f.close();
g.close();
return 0;
}