Pagini recente » Cod sursa (job #654271) | Cod sursa (job #2740173) | Cod sursa (job #1291911) | Cod sursa (job #3215263) | Cod sursa (job #3240057)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, w[5002], p[5002], dp[2][5002];
int main(){
in>>n>>g;
for(int i = 1; i <= n; i++)
in>>w[i]>>p[i];
for(int i = 1; i <= n; i++){
for(int j = 1; j <= g; j++){
if(w[i] <= j && p[i] + dp[(i - 1) & 1][j - w[i]] > dp[(i - 1) & 1][j])
dp[i & 1][j] = p[i] + dp[(i - 1) & 1][j - w[i]]; else dp[i & 1][j] = dp[(i - 1) & 1][j];
}
}
out<<dp[n & 1][g];
return 0;
}