Cod sursa(job #3287998)
| Utilizator | Data | 20 martie 2025 11:44:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fcin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,dp[1001][1001],maxx;
struct obiect
{
int x,y;
};
obiect v[10000];
int main()
{
fcin>>n>>g;
for(int i=1; i<=n; i++)
{
fcin>>v[i].x>>v[i].y;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=g; j++)
{
if(j-v[i].x>=0)
dp[i][j]=max(dp[i-1][j], dp[i-1][j-v[i].x]+v[i].y);
}
}
fout<<dp[n][g];
return 0;
}
