Pagini recente » Cod sursa (job #3252395) | Cod sursa (job #1806267) | Cod sursa (job #1149581) | Cod sursa (job #1808270) | Cod sursa (job #3209153)
#include <bits/stdc++.h>
int main()
{
int n, s;
std::vector<std::pair<int, int>> objs;
std::vector<std::vector<int>> dp;
std::ifstream fin("rucsac.in");
fin >> n >> s;
objs.resize(n);
dp.resize(s + 1, std::vector<int>(n + 1, 0));
for (int w, p, i = 0; i < n; ++i) {
fin >> w >> p;
objs[i].first = w;
objs[i].second = p;
}
fin.close();
for (int j = 1; j <= s; ++j)
for (int i = 1; i <= n; ++i)
if (j >= objs[i - 1].first)
// aici la objs am pus i - 1 pt ca e indexat de la 0
// trebuia sa fie i
dp[j][i] = std::max(dp[j][i - 1], dp[j - objs[i - 1].first][i - 1] + objs[i - 1].second);
else
dp[j][i] = dp[j][i - 1];
std::ofstream fout("rucsac.out");
fout << dp[s][n] << '\n';
fout.close();
return 0;
}