Cod sursa(job #2485999)
| Utilizator | Data | 2 noiembrie 2019 11:09:22 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<bits/stdc++.h>
#define M 5005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[M],p[M],n,g,dp[2][10005];
void citire()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
fin>>w[i]>>p[i];
}
void pg()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j-w[i]>=0)
{
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];
}
int main()
{
citire();
pg();
return 0;
}
