Cod sursa(job #3228475)
Utilizator | Data | 8 mai 2024 12:50:02 | |
---|---|---|---|
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,n,k,a[10001];
int main()
{
for(F>>i>>n;F>>i>>j;)
for(k=n;k>=i;a[k]=max(a[k],a[k-i]+j),--k);
return G<<a[n],0;
}