'commit'

TangDou/BeiBao/MaxMin/Wq_AboveMin1.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N];
+
+int main() {
+    cin >> n >> m;
+
+    memset(f, INF, sizeof f);
+    f[0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        cin >> v >> w;
+        for (int j = m; j >= 0; j--)
+            f[j] = min(f[j], f[max(0, j - v)] + w);//即使物品体积比j大，j - v < 0，也能选，等价于f[0]
+    }
+    cout << f[m] << endl;
+    return 0;
+}