Cod sursa(job #3040029)
Utilizator | Data | 29 martie 2023 11:26:40 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
fin >> n >> g;
vector<int> dp(g + 1, 0);
for (int i = 0, w, p; i < n; ++i) {
fin >> w >> p;
for (int i = g; i >= w; --i)
dp[i] = max(dp[i], dp[i - w] + p);
}
fout << dp[g] << '\n';
}