Cod sursa(job #3364331)
| Utilizator | Data | 1 septembrie 2026 19:31:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| 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,g[5003],s[5003],dp[100003],rasp;
int main()
{
cin>>n>>G;
dp[0]=0;
for(int i=1;i<=n;i++)
{
cin>>g[i]>>s[i];
}
for(int i=1;i<=n;i++)
{
for(int j=G;j>=g[i];j--)
{
dp[j]=max(dp[j],dp[j-g[i]]+s[i]);
}
}
for(int i=1;i<=G;i++)
{
rasp=max(rasp,dp[i]);
}
cout<<rasp;
return 0;
}
