Cod sursa(job #2626397)
Utilizator | Hosu Iulia Iulia25 | Data | 6 iunie 2020 14:12:01 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int dp[2][10005];
int Max;
int main()
{
int n,g,i, gmax, p, j;
cin >> n >> gmax;
for(i=1;i<=n;i++)
{
cin>>g>>p;
for(j=0;j<=gmax;j++)
{
if(j>=g) dp[i % 2][j]=max(dp[(i-1) % 2][j-g]+p, dp[(i-1)%2][j]);
else dp[i%2][j]= dp[(i - 1) % 2][j];
Max = max(Max, dp[i % 2][j]);
}
}
cout << Max;
return 0;
}