Cod sursa(job #2878785)
| Utilizator | Data | 27 martie 2022 18:09:10 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,gr;
cin>>n>>gr;
int v[n+1],g[n+1];
for(int i=1;i<=n;++i)
{
cin>>g[i]>>v[i];
}
int dp[gr+1];
for(int i=0;i<=gr;++i)
{
dp[i]=0;
}
dp[0]=0;
for(int i=1;i<=n;++i)
{
for(int pg=gr-g[i];pg>=0;pg--)
{
if(dp[pg]!=-1)dp[pg+g[i]]=max(dp[pg+g[i]],dp[pg]+v[i]);
}
}
int ans=0;
for(int i=0;i<=gr;++i)
{
ans=max(ans,dp[i]);
}
cout<<ans;
return 0;
}
