Cod sursa(job #2705842)
Utilizator | Data | 13 februarie 2021 13:35:20 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N,Gmax,G[5002],P[5002],dp[10002],mx;
int main()
{
fin>>N>>Gmax;
for(int i=1;i<=N;i++)
fin>>G[i]>>P[i];
for(int i=1;i<=N;i++)
{
for(int j=Gmax;j>=G[i];j--)
{
dp[j]=max(dp[j],dp[j-G[i]]+P[i]);
}
}
for(int i=1;i<=Gmax;i++)
mx=max(mx,dp[i]);
fout<<mx;
}