Cod sursa(job #2513070)
| Utilizator | Data | 22 decembrie 2019 12:56:49 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N,G,w[50005],p[10005],dp[2][10005];
int main()
{
fin>>N>>G;
for(int i=1; i<=N; i++)
fin>>w[i]>>p[i];
for(int i=1; i<=N; i++)
for(int j=1; j<=G; j++)
{
if(j>=w[i])
dp[i%2][j]=max(dp[(i-1)%2][j],dp[(i-1)%2][j-w[i]]+p[i]);
else
dp[i%2][j]=dp[(i-1)%2][j];
}
fout<<dp[N%2][G];
return 0;
}
