Cod sursa(job #3190104)
| Utilizator | Data | 6 ianuarie 2024 23:31:56 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int n,g,i,j,a[5005],b[5005],dp[5005][10005];
int main()
{
cin>>n>>g;
for(i=1;i<=n;i++)
cin>>a[i]>>b[i];
for(i=1;i<=n;i++)
for(j=1;j<=g;j++)
{
if(a[i]>j)
dp[i][j]=dp[i-1][j];
else
dp[i][j]=max(dp[i-1][j],dp[i-1][j-a[i]]+b[i]);
}
cout<<dp[n][g];
return 0;
}
