Pagini recente » Cod sursa (job #1122100) | Cod sursa (job #1784595) | Cod sursa (job #1032231) | Cod sursa (job #252120) | Cod sursa (job #2240433)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main() {
int n, capacity;
fin >> n >> capacity;
vector<int> dp(capacity + 1, 0);
int ans = 0;
while (n--) {
int w_i, p_i;
fin >> w_i >> p_i;
for (int i = capacity; i >= w_i; --i) {
dp[i] = max(dp[i], dp[i - w_i] + p_i);
ans = max(ans, dp[i]);
}
}
fout << ans;
return 0;
}