Cod sursa(job #3219365)
Utilizator | Biclineru Radu Radu_Bicli | Data | 31 martie 2024 10:51:31 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, i, j, gr[5002], pr[5002];
int a[5002][10002], g;
int main() {
fin >> n >> g;
for(i = 1; i <= n; i++) fin >> gr[i] >> pr[i];
for(i = 1; i <= n; i++) {
for(j = 1; j <= g; j++) {
a[i][j] = a[i - 1][j];
if(gr[i] <= j) a[i][j] = max(a[i][j], pr[i] + a[i - 1][j - gr[i]]);
}
}
fout << a[n][g];
return 0;
}