Cod sursa(job #2976121)
| Utilizator | Data | 8 februarie 2023 12:15:43 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int m[10005], p[10005], dp[2][10005], sol[5005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g, a, b, s=0;
cin>>n>>g;
for(int i=0;i<n;i++)
{
cin>>m[i]>>p[i];
}
for(int i=0;i<n;i++)
{
for(int j=0;j<=g;j++)
{
dp[(i+1)%2][j]=0;
if(j<m[i])
dp[(i+1)%2][j]=dp[i%2][j];
else
dp[(i+1)%2][j]=max(dp[i%2][j], dp[i%2][j-m[i]] + p[i]);
}
}
cout<<dp[n%2][g];
return 0;
}
