Cod sursa(job #2925701)
| Utilizator | Data | 15 octombrie 2022 21:33:45 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
std::ifstream F("rucsac.in");
int g[5001],c[5001],s[10001],m,n,i,j;
int main()
{
for(F>>n>>m;i<n;F>>g[i]>>c[i],++i);
for(i=0;i<n;++i)
for(j=m-g[i];j>=0;s[j+g[i]]=std::max(s[j+g[i]],s[j]+c[i]),--j);
return std::ofstream("rucsac.out")<<s[m],0;
}
