Cod sursa(job #3143030)
Utilizator | Data | 27 iulie 2023 00:23:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 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[2][10005];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
int l=0;
for(int i=1;i<=n;i++,l=1-l)
{
for(int j=0;j<=g;j++)
{
dp[1-l][j]=dp[l][j];
if(w[i]<=j)
{
dp[1-l][j]=max(dp[1-l][j],dp[l][j-w[i]]+p[i]);
}
}
}
fout<<dp[l][g];
}