Cod sursa(job #2802907)
Utilizator | Data | 19 noiembrie 2021 07:44:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[2][10001];
int main()
{
int n,g,w,p;
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w>>p;
for(int j=0;j<=g;j++)
{
dp[1][j]=dp[0][j];
if(j>=w)
dp[1][j]=max(dp[1][j], dp[0][j-w]+p);
}
for(int j=0;j<=g;j++)
dp[0][j]=dp[1][j];
}
int maxim=-1;
for(int i=0;i<=g;i++)
{
maxim=max(maxim, dp[1][i]);
}
fout<<maxim;
}