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