Pagini recente » Cod sursa (job #2007920) | Cod sursa (job #1295715) | Cod sursa (job #1295689) | Cod sursa (job #2198509) | Cod sursa (job #3320870)
#include <fstream>
#include <vector>
using namespace std;
struct obiect
{
int g, p;
};
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, k;
in >> n >> k;
vector <obiect> v(n);
for (int i = 0; i < n; i++)
{
in >> v[i].g >> v[i].p;
}
vector <int> profit(k + 1, -1);
profit[0] = 0;
for (int i = 0; i < n; i++)
{
for (int j = k; j >= v[i].g; j--)
{
if (profit[j-v[i].g] != -1)
{
profit[j] = max(profit[j], profit[j-v[i].g] + v[i].p);
}
}
}
int profit_max = 0;
for (int j = 1; j <= k; j++)
{
profit_max = max(profit_max, profit[j]);
}
out << profit_max << "\n";
in.close();
out.close();
return 0;
}