Cod sursa(job #3223995)
Utilizator | Data | 14 aprilie 2024 12:10:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.23 kb |
#include<fstream>
using namespace std;
ifstream F("rucsac.in");
ofstream G("rucsac.out");
int i,j,k,g,d[10001];
int main()
{
for(F>>i>>g;F>>i>>j;)
for(k=g;k>=i;d[k]=max(d[k],d[k-i]+j),--k);
return G<<d[g],0;
}