Pagini recente » Cod sursa (job #175709) | Cod sursa (job #676958) | Cod sursa (job #2093628) | Cod sursa (job #105122) | Cod sursa (job #2637075)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, dp[2][10005], w[5005], p[5005], pmax;
void citire() {
fin >> n >> g;
for(int i = 1; i<= n; i++)
fin >> w[i] >> p[i];
}
void solve() {
for(int i = 1; i <= n; i++)
for(int j = 0; j <= g; j++) {
dp[i%2][j] = dp[(i-1)%2][j];
if(j >= w[i]) dp[i%2][j] = max(dp[i%2][j], dp[(i-1)%2][j-w[i]]+p[i]);
pmax = max(pmax, dp[i%2][j]);
}
fout << pmax;
}
int main() {
citire();
solve();
}