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 | e366c2e5b6562cba837a898d2b9477675fb07be0 (patch) | |
| tree | 11aa6d5ec11974250321c43c38aa61409b4dd2aa /acwing/2.cpp | |
| parent | d8f3b40085619cb680c8f227c65a1f5acc393223 (diff) | |
| download | solutions-e366c2e5b6562cba837a898d2b9477675fb07be0.tar.gz solutions-e366c2e5b6562cba837a898d2b9477675fb07be0.tar.bz2 solutions-e366c2e5b6562cba837a898d2b9477675fb07be0.zip | |
Add acwing problem 2 (pack problem).
Diffstat (limited to 'acwing/2.cpp')
| -rw-r--r-- | acwing/2.cpp | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/acwing/2.cpp b/acwing/2.cpp new file mode 100644 index 0000000..1a75c19 --- /dev/null +++ b/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;
+}
|