Cod sursa(job #3344145)
| Utilizator | Data | 1 martie 2026 14:29:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int dp[10001];
int main()
{
int n,g,j;
fin>>n>>g;
for(int i=1;i<=n;i++)
{
int w,p;
fin>>w>>p;
for( j=g;j>=w;j--)
{
dp[j]=max(dp[j],dp[j-w]+p);
}
}
fout<<dp[g];
return 0;
}
