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 | 07289d1382e192bcde6df1d0aa0e863a67458620 (patch) | |
| tree | 1b19ebd759fcbe30f22345cdd80c99db3133d060 | |
| parent | fc69005e77df8bd4b1a93be8dedf66f8feb39f82 (diff) | |
| download | solutions-07289d1382e192bcde6df1d0aa0e863a67458620.tar.gz solutions-07289d1382e192bcde6df1d0aa0e863a67458620.tar.bz2 solutions-07289d1382e192bcde6df1d0aa0e863a67458620.zip | |
Add acwing problem 8.
| -rw-r--r-- | acwing/8.cpp | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/acwing/8.cpp b/acwing/8.cpp new file mode 100644 index 0000000..f62d21e --- /dev/null +++ b/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 |