Pagini recente » Cod sursa (job #209434) | Cod sursa (job #937887) | Cod sursa (job #1869168) | Cod sursa (job #886977) | Cod sursa (job #1686189)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int m[1005][2005], i, j, n, G, w[5005], p[5005];
int main()
{ f>>n>>G;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{ for(j=1;j<=G;j++)
if(w[i]<=j)
m[i][j]=max(m[i-1][j],m[i-1][j-w[i]]+p[i]);
else m[i][j]=m[i-1][j];
}
g<<m[n][G];
return 0;
}