Cod sursa(job #3143029)
| Utilizator | Data | 27 iulie 2023 00:15:22 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
#define ll unsigned long long int
#define MOD 666013
using namespace std;
string nume="rucsac";
ifstream fin(nume+".in");
ofstream fout(nume+".out");
int n,g;
int w[10005],p[10005];
int dp[10005][10005];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
dp[i][0]=0;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j>=w[i])
{
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+p[i]);
}
else{
dp[i][j]=dp[i-1][j];
}
}
}
fout<<dp[n][g];
}
