diff options
author | crupest <crupest@outlook.com> | 2021-02-24 14:55:08 +0800 |
---|---|---|
committer | crupest <crupest@outlook.com> | 2021-02-24 14:55:08 +0800 |
commit | de8f16f524a160199c9dfbf78c26d9eb080b5e9a (patch) | |
tree | d3cc8c76fd342f3c026de88153d67872583059cc | |
parent | e5452ef933639924a49a512542f1218d7079e0f4 (diff) | |
download | crupest-de8f16f524a160199c9dfbf78c26d9eb080b5e9a.tar.gz crupest-de8f16f524a160199c9dfbf78c26d9eb080b5e9a.tar.bz2 crupest-de8f16f524a160199c9dfbf78c26d9eb080b5e9a.zip |
import(solutions): Add acwing problem 3 (aka. complete pack problem).
-rw-r--r-- | works/solutions/acwing/3-2.cpp | 29 | ||||
-rw-r--r-- | works/solutions/acwing/3.cpp | 29 |
2 files changed, 58 insertions, 0 deletions
diff --git a/works/solutions/acwing/3-2.cpp b/works/solutions/acwing/3-2.cpp new file mode 100644 index 0000000..6565c5b --- /dev/null +++ b/works/solutions/acwing/3-2.cpp @@ -0,0 +1,29 @@ +#include <algorithm>
+#include <iostream>
+
+int N, V;
+int v[1001];
+int w[1001];
+int states[1001];
+
+int main() {
+ std::cin >> N >> V;
+
+ for (int i = 1; i <= N; i++) {
+ std::cin >> v[i] >> w[i];
+ }
+
+ for (int i = 1; i <= N; i++) {
+ for (int j = 0; j <= V; j++) {
+ if (j >= v[i]) {
+ states[j] = std::max(states[j], states[j - v[i]] + w[i]);
+ } else {
+ states[j] = states[j];
+ }
+ }
+ }
+
+ std::cout << states[V];
+
+ return 0;
+}
diff --git a/works/solutions/acwing/3.cpp b/works/solutions/acwing/3.cpp new file mode 100644 index 0000000..21bd8dc --- /dev/null +++ b/works/solutions/acwing/3.cpp @@ -0,0 +1,29 @@ +#include <algorithm>
+#include <iostream>
+
+int N, V;
+int v[1001];
+int w[1001];
+int states[1001][1001];
+
+int main() {
+ std::cin >> N >> V;
+
+ for (int i = 1; i <= N; i++) {
+ std::cin >> v[i] >> w[i];
+ }
+
+ for (int i = 1; i <= N; i++) {
+ for (int j = 0; j <= V; j++) {
+ if (j >= v[i]) {
+ states[i][j] = std::max(states[i - 1][j], states[i][j - v[i]] + w[i]);
+ } else {
+ states[i][j] = states[i - 1][j];
+ }
+ }
+ }
+
+ std::cout << states[N][V];
+
+ return 0;
+}
|