Cod sursa(job #3291283)
Utilizator | Data | 3 aprilie 2025 22:47:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g;
struct da
{
int g;
int p;
}x;
int dp[10003];
int main()
{
fin>>n>>g;
for (int i=1;i<=n;i++)
{
fin>>x.g>>x.p;
for (int j=g;j>=1;j--)
{
if (j-x.g>=0)
dp[j]=max(dp[j],dp[j-x.g]+x.p);
}
}
fout<<dp[g];
return 0;
}