Cod sursa(job #3263586)
| Utilizator | Data | 15 decembrie 2024 11:46:08 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main() {
int w[5005], p[5005];
int dp[10005] = {0};
int n, gmax;
fin >> n >> gmax;
for (int i = 1; i <= n; ++i) {
fin >> w[i] >> p[i];
}
for (int i = 1; i <= n; ++i) {
for (int j = gmax; j >= w[i]; --j) {
if (dp[j - w[i]] + p[i] > dp[j]) {
dp[j] = dp[j - w[i]] + p[i];
}
}
}
fout << dp[gmax];
return 0;
}
