Cod sursa(job #3296939)
Utilizator | Data | 19 mai 2025 07:54:51 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define nmax 10005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,Gmax,g[nmax],p[nmax],dp[nmax],sol;
int main()
{
fin>>n>>Gmax;
for(int i=1; i<=n; i++)
fin>>g[i]>>p[i];
dp[0]=1;
for(int i=1; i<=n; i++)
{
for(int j=Gmax; j>=0; j--)
{
if(dp[j]!=0 and j+g[i]<=Gmax)
{
dp[j+g[i]]=max(dp[j+g[i]],dp[j]+p[i]);
sol=max(sol,dp[j+g[i]]);
}
}
}
fout<<sol-1;
}