Pagini recente » Cod sursa (job #1737798) | Cod sursa (job #383110) | Cod sursa (job #170027) | Cod sursa (job #1160339) | Cod sursa (job #3244284)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[10005];
int dp[10005][10005];
int p[10005];
int main()
{
int n,g;
fin>>n>>g;
for(int i=1;i<=n;i++){
fin>>w[i]>>p[i];
}
int rasp;
for(int i=1;i<=n;i++){
int lin_cur=i%2;
int lin_ant=1-lin_cur;
for(int j=w[i];j<=g;j++){
dp[lin_cur][j]=max(dp[lin_ant][j],dp[lin_ant][j-w[i]]+p[i]) ;
rasp=dp[n%2][j];
}
}
fout<<rasp;
}