Pagini recente » Cod sursa (job #3186473) | Cod sursa (job #1605788) | Cod sursa (job #349758) | Cod sursa (job #310333) | Cod sursa (job #3165141)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[5005][10005];
int main(){
int answer = 0;
int n, g;
fin >> n >> g;
for (int i = 1; i <= n; i++){
int greutate, cost;
fin >> greutate >> cost;
for (int j = greutate; j <= g; j++){
dp[i][j] = max(dp[i-1][j - greutate] + cost, dp[i-1][j]);
answer = max(answer, dp[i][j]);
}
}
fout << answer;
return 0;
}