Cod sursa(job #3162456)
Utilizator | Data | 29 octombrie 2023 12:05:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[10001],n,i,j,g,G,p;
int main()
{
cin>>n>>G;
memset(dp,-1,sizeof(dp));
dp[0]=0;
for(i=1;i<=n;i++)
{
cin>>g>>p;
for(j=G-g;j>=0;j--)///j greutate obt anterior
if(dp[j]!=-1&&dp[j+g]<p+dp[j])
dp[j+g]=dp[j]+p;
}
///det max din dp;
int Max=-1;
for(i=1;i<=G;i++)
Max=max(Max,dp[i]);
cout<<Max;
return 0;
}