Pagini recente » Cod sursa (job #2888615) | Cod sursa (job #346159) | Cod sursa (job #1246847) | Cod sursa (job #1632934) | Cod sursa (job #2538875)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int dp[1000][1000], w[1000], p[1000], n, g;
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 cw=0;cw<=g;cw++){
dp[i][cw]=dp[i-1][cw];
if(w[i]<=cw){
dp[i][cw]=max(dp[i][cw], dp[i-1][cw-w[i]]+p[i]);
}
}
}
out<<dp[n][g];
}