Pagini recente » Cod sursa (job #2142504) | Cod sursa (job #867073) | Cod sursa (job #2800172) | Cod sursa (job #3163032) | Cod sursa (job #2999768)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
struct obiect{
int w, p;
};
struct linie{
int cur, ant;
};
int dp[2][10001];
vector < obiect > v;
linie lin;
int main()
{
v.resize(5001);
int n, g;
cin >> n >> g;
for(int i = 1; i <= n; i++)
{
cin >> v[i].w >> v[i].p;
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= g; j++)
{
lin.cur = i % 2;
lin.ant = (i - 1) % 2;
if(j < v[i].w)
{
dp[lin.cur][j] = dp[lin.ant][j];
}
else
{
dp[lin.cur][j] = max(dp[lin.ant][j - v[i].w] + v[i].p, dp[lin.ant][j]);
}
}
}
cout << dp[n % 2][g];
return 0;
}