Pagini recente » Cod sursa (job #2109508) | Istoria paginii runda/wellcodesimulareav-12martie/clasament | Cod sursa (job #1448161) | Cod sursa (job #1102305) | Cod sursa (job #3289909)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
typedef pair<int, int> pi;
const int NMAX = 5001;
const int GMAX = 1e4 + 1;
int dp[NMAX][GMAX];
int n, g, a, b;
vector<pi> v;
int main()
{
fin >> n >> g;
v.push_back({0, 0});
for (int i = 1; i <= n; ++i)
{
fin >> a >> b;
v.push_back({a, b});
}
for (int i = 1; i <= n; ++i)
{
for (int j = v[i].first; j <= g; ++j)
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i].first] + v[i].second);
}
fout << dp[n][g] << '\n';
return 0;
}