Cod sursa(job #2685507)
Utilizator | Data | 17 decembrie 2020 10:08:14 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,i,w[5010],p[5010],d[10010],cw,ans;
int main()
{
fin>>n>>g;
for(i=1;i<=n;i++)
fin>>w[i]>>p[i];
for(i=1;i<=n;i++)
for(cw=g-w[i];cw>=0;cw--)
if(d[cw+w[i]]<d[cw]+p[i])
{
d[cw+w[i]]=d[cw]+p[i];
ans=max(d[cw+w[i]],ans);
}
fout<<ans;
return 0;
}