diff options
| author | crupest <crupest@outlook.com> | 2021-02-23 21:27:58 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-23 21:27:58 +0800 |
| commit | 3ef437c49bc74f8e4553f6d9b7021a9332c432d6 (patch) | |
| tree | 93fe579a08d9958be8aee0c07d8bd004cd7c5fd8 | |
| parent | e353213dfb73259a5d33cc6e9d5cd2373c683be9 (diff) | |
| download | crupest-3ef437c49bc74f8e4553f6d9b7021a9332c432d6.tar.gz crupest-3ef437c49bc74f8e4553f6d9b7021a9332c432d6.tar.bz2 crupest-3ef437c49bc74f8e4553f6d9b7021a9332c432d6.zip | |
import(solutions): Add acwing problem 2 (pack problem).
| -rw-r--r-- | works/solutions/.gitignore | 4 | ||||
| -rw-r--r-- | works/solutions/acwing/2-2.cpp | 29 | ||||
| -rw-r--r-- | works/solutions/acwing/2.cpp | 30 |
3 files changed, 62 insertions, 1 deletions
diff --git a/works/solutions/.gitignore b/works/solutions/.gitignore index 600d2d3..f676862 100644 --- a/works/solutions/.gitignore +++ b/works/solutions/.gitignore @@ -1 +1,3 @@ -.vscode
\ No newline at end of file +.vscode
+*.exe
+*.pdb
diff --git a/works/solutions/acwing/2-2.cpp b/works/solutions/acwing/2-2.cpp new file mode 100644 index 0000000..de812f4 --- /dev/null +++ b/works/solutions/acwing/2-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 = V; j >= 0; 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/2.cpp b/works/solutions/acwing/2.cpp new file mode 100644 index 0000000..1a75c19 --- /dev/null +++ b/works/solutions/acwing/2.cpp @@ -0,0 +1,30 @@ +#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 = V; j >= 0; j--) {
+ if (j >= v[i]) {
+ states[i][j] =
+ std::max(states[i - 1][j], states[i - 1][j - v[i]] + w[i]);
+ } else {
+ states[i][j] = states[i - 1][j];
+ }
+ }
+ }
+
+ std::cout << states[N][V];
+
+ return 0;
+}
|