Cod sursa(job #2797747)
| Utilizator | Data | 10 noiembrie 2021 15:45:42 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, wtMax, w[5005], v[5005], dp[10005];
int main() {
fin >> n >> wtMax;
for(int i = 1; i <= n; i++) {
fin >> w[i] >> v[i];
}
int wt = 0;
for(int i = 1; i <= n; i++) {
for(int j = wtMax - w[i]; j >= 0; j--) {
if(dp[j + w[i]] < dp[j] + v[i]) {
dp[j + w[i]] = dp[j] + v[i];
if(dp[j + w[i]] > wt) {
wt = dp[j + w[i]];
}
}
}
}
fout << wt;
return 0;
}
