Pagini recente » Cod sursa (job #1119212) | Cod sursa (job #1077769) | Monitorul de evaluare | Cod sursa (job #1490178) | Cod sursa (job #1846887)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,w[101],p[101];long long V[101];
void load(){f>>n>>G;for (int i=1;i<=n;i++) f>>w[i]>>p[i];}
int rucsac()
{int i,j;
for(i=1;i<=n;i++)for(j=G;j>=w[i];j--)V[j]=max(V[j],V[j-w[i]]+p[i]);
return V[G];
}
int main()
{
load();g<<rucsac();
return 0;
}