diff options
| author | crupest <crupest@outlook.com> | 2021-02-24 15:46:10 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-24 15:46:10 +0800 |
| commit | ad3e1e731ebd78bfb99f000cf2d294e9705fdfe0 (patch) | |
| tree | 2f31491d1ac5c5dd08ed66e319602cc1cb48f085 | |
| parent | a7a2582fc75aa1b2d4e56a01e07174f4083f203d (diff) | |
| download | crupest-ad3e1e731ebd78bfb99f000cf2d294e9705fdfe0.tar.gz crupest-ad3e1e731ebd78bfb99f000cf2d294e9705fdfe0.tar.bz2 crupest-ad3e1e731ebd78bfb99f000cf2d294e9705fdfe0.zip | |
import(solutions): Add acwing problem 8.
| -rw-r--r-- | works/solutions/acwing/8.cpp | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/works/solutions/acwing/8.cpp b/works/solutions/acwing/8.cpp new file mode 100644 index 0000000..f62d21e --- /dev/null +++ b/works/solutions/acwing/8.cpp @@ -0,0 +1,29 @@ +#include <algorithm>
+#include <iostream>
+
+int N, V, M;
+int v[1001];
+int w[1001];
+int m[1001];
+int states[101][101];
+
+int main() {
+ std::cin >> N >> V >> M;
+
+ for (int i = 1; i <= N; i++) {
+ std::cin >> v[i] >> m[i] >> w[i];
+ }
+
+ for (int i = 1; i <= N; i++) {
+ for (int j = V; j >= v[i]; j--) {
+ for (int k = M; k >= m[i]; k--) {
+ states[j][k] =
+ std::max(states[j][k], states[j - v[i]][k - m[i]] + w[i]);
+ }
+ }
+ }
+
+ std::cout << states[V][M];
+
+ return 0;
+}
\ No newline at end of file |