Pagini recente » Cod sursa (job #1825583) | Cod sursa (job #727565) | Cod sursa (job #1157747) | Cod sursa (job #3212760) | Cod sursa (job #1618902)
#include <fstream>
using namespace std;
int d[5001][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)
{
d[i][j]=d[i-1][j];
if(gr[i]<=j)
{
d[i][j]=max(d[i][j],d[i-1][j-gr[i]]+c[i]);
}
}
}
g<<d[n][gre];
f.close();
g.close();
return 0;
}