Cod sursa(job #2831646)
Utilizator | Data | 11 ianuarie 2022 20:23:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,i,j,sol,c[5001],p[5001],d[10001];
int main() {
fin>>n>>g;
for (i=1;i<=n;i++)
fin>>c[i]>>p[i];
for (i=1;i<=n;i++)
for (j=g-c[i];j>=0;j--)
if (d[j]+p[i]>d[j+c[i]])
d[j+c[i]]=d[j]+p[i];
for (i=0;i<=g;i++)
sol=max(sol,d[i]);
fout<<sol;
return 0;
}