Cod sursa(job #3323993)
| Utilizator | Data | 20 noiembrie 2025 17:42:31 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,g,w,p,dp[10005],i,j;
int main()
{
cin>>n>>g;
for(i=1;i<=n;i++)
{
cin>>w>>p;
for(j=g;j>=w;j--)
{
dp[j]=max(dp[j],dp[j-w]+p);
}
}
cout<<dp[g];
return 0;
}
