Cod sursa(job #2790262)
Utilizator | Data | 28 octombrie 2021 18:00:27 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int dp[10010];
int main()
{
int n,gmax,i,j,g,p,maxx;
cin>>n>>gmax;
for (i=1; i<=n; i++)
{
cin>>g>>p;
for (j=gmax; j>=g; j--)
dp[j]=max(dp[j-g]+p,dp[j]);
}
cout<<dp[gmax];
return 0;
}