Cod sursa(job #2773583)
| Utilizator | Data | 7 septembrie 2021 19:13:59 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define GMAX 10001
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[GMAX];
int main() {
int n, max_weight, weight, val;
fin >> n >> max_weight;
for(int i = 1; i <= n; i++) {
fin >> weight >> val;
for(int j = max_weight; j >= weight; j--)
dp[j] = max(dp[j], dp[j - weight] + val);
}
fout << dp[max_weight];
}
