Pagini recente » Cod sursa (job #2845578) | Cod sursa (job #3235857) | Cod sursa (job #1886020) | Borderou de evaluare (job #366981) | Cod sursa (job #3230100)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, dp[20010], i, j;
pair<int, int> a;
int main()
{
in >> n >> g;
for (i = 1; i <= n; i++)
{
in >> a.first >> a.second;
for (j = g; j >= 1; j--)
{
if (a.first <= j)
dp[j] = max(dp[j], dp[j - a.first] + a.second);
}
}
out << dp[g];
return 0;
}