Cod sursa(job #2949772)
Utilizator | Data | 1 decembrie 2022 17:44:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream F("rucsac.in");
ofstream G("rucsac.out");
int n,m,a[5001],b[5001],c[10001],i,j;
int main()
{
for(F>>n>>m,i=1;i<=n;F>>a[i]>>b[i],++i);
for(i=1;i<=n;++i)
for(j=m-a[i];j>=0;--j)
if(c[j+a[i]]<c[j]+b[i])
c[j+a[i]]=c[j]+b[i];
return G<<c[m],0;
}