'commit'

TangDou/BeiBao/MaxMin/01_EqMax2.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N][N];
+
+int main() {
+    cin >> n >> m;
+
+    memset(f, -INF, sizeof f);
+    f[0][0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        cin >> v >> w;
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = max(f[i][j], f[i - 1][j - v] + w);
+        }
+    }
+    cout << f[n][m] << endl;
+    return 0;
+}