Pagini recente » Cod sursa (job #687179) | Borderou de evaluare (job #777675) | Borderou de evaluare (job #430047) | Cod sursa (job #1970661) | Cod sursa (job #2165367)
#include <iostream>
#include <fstream>
using namespace std;
int w[10010], p[10010], a[10010], b[10010];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
fin >> n >> g;
for (int i=1; i<=n; i++)
fin >> w[i] >> p[i];
for (int i=1; i<=n; i++)
{
for (int j=0; j<=g; j++)
{
if (w[i]<=j)
b[j]=max(a[j], a[j-w[i]]+p[i]);
else
b[j]=a[j];
}
for (int j=0; j<=g; j++)
a[j]=b[j];
}
fout << b[g];
return 0;
}