Pagini recente » Cod sursa (job #2990936) | Cod sursa (job #2688943) | Cod sursa (job #2032840) | Cod sursa (job #2244098) | Cod sursa (job #3130974)
#include <iostream>
#include <fstream>
using namespace std;
int greutati[5005],ob[5005];
int dp[10005];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g;
fin >> n >> g;
for(int i=1; i<=n; i++)
fin >> greutati[i] >> ob[i];
for(int i=1; i<=n; i++)
{
for(int j=g; j>=greutati[i]; j--)
{
dp[j]=max(dp[j], dp[j-greutati[i]]+ob[i]);
}
}
fout << dp[g];
return 0;
}