Cod sursa(job #2174925)
Utilizator | Data | 16 martie 2018 14:16:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[10002],l,n;
int g[5002],p[5002];
int main()
{
fin>>n>>l;
for(int i=1;i<=n;i++)
fin>>g[i]>>p[i];
for(int i=1;i<=n;i++)
for(int j=l;j>=g[i];j--)
d[j]=max(d[j],d[j-g[i]]+p[i]);
fout<<d[l];
return 0;
}