Pagini recente » Borderou de evaluare (job #3009578) | Borderou de evaluare (job #1517187) | Cod sursa (job #622752) | Monitorul de evaluare | Cod sursa (job #3303855)
#include <fstream>
#include <vector>
using namespace std;
ifstream be("rucsac.in");
ofstream ki("rucsac.out");
int main()
{
int n, g;
be >> n >> g;
vector<int> w(n + 1);
vector<int> p(n + 1);
for(int i = 1; i <= n; i++)
{
be >> w[i] >> p[i];
}
vector<int> dp_akt(g + 1);
vector<int> dp_elo(g + 1);
for(int i = 1; i <= n; i++)
{
dp_elo = dp_akt;
for(int j = 1; j <= g; j++)
{
if(j >= w[i])
{
dp_akt[j] = max(p[i] + dp_elo[j - w[i]], dp_elo[j]);
}else
{
dp_akt[j] = dp_elo[j];
}
}
}
ki << dp_akt[g];
return 0;
}