Cod sursa(job #1919996)
Utilizator | Data | 9 martie 2017 21:56:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dini[10010],pr[10010],gr[10010],i,j,l,n,m;
int main()
{
fin>>n>>m;
for(i=1;i<=n;++i)
fin>>gr[i]>>pr[i];
for(i=1;i<=n;++i)
{
for(j=m;j>=gr[i];--j)
dini[j]=max(dini[j],dini[j-gr[i]]+pr[i]);
}
fout<<dini[m];
return 0;
}