Cod sursa(job #3238460)
| Utilizator | Data | 25 iulie 2024 17:27:48 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, pret[5001], greutate[5001], D[5001];
int main()
{
fin >> n >> g;
for(int i = 1; i <= n; i++){
fin >> greutate[i] >> pret[i];
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= g; j++){
if(D[j] < D[j - greutate[i]] + pret[i]){
D[j] = D[j - greutate[i]] + pret[i];
} else {
D[j] = D[j-1];
}
}
}
cout << D[g];
fout << D[g];
return 0;
}
