2323 solved.

liuyubobobo · liuyubobobo · commit 7e066b3c22fa · 2022-06-30T21:49:47.000-07:00
diff --git a/2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/CMakeLists.txt b/2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_2323)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_2323 main.cpp)
diff --git a/2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/main.cpp b/2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/main.cpp
@@ -0,0 +1,48 @@
+/// Source : https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii/
+/// Author : liuyubobobo
+/// Time   : 2022-06-30
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+
+/// Binary Search
+/// Time Complexity: O(nlogn + nlog(max_jobs))
+/// Space Complexity: O(1)
+class Solution {
+public:
+    int minimumTime(vector<int>& jobs, vector<int>& workers) {
+
+        sort(jobs.begin(), jobs.end());
+        sort(workers.begin(), workers.end());
+
+        int l = 1, r = 1e5;
+        while(l < r){
+            int mid = (l + r) / 2;
+            if(ok(jobs, workers, mid)) r = mid;
+            else l = mid + 1;
+        }
+        return l;
+    }
+
+private:
+    bool ok(const vector<int>& jobs, const vector<int>& workers, int d){
+
+        for(int i = 0; i < workers.size(); i ++)
+            if(1ll * workers[i] * d < 1ll * jobs[i]) return false;
+        return true;
+    }
+};
+
+
+int main() {
+
+    vector<int> jobs1 = {5, 2, 4}, workers1 = {1, 7, 5};
+    cout << Solution().minimumTime(jobs1, workers1) << '\n';
+    // 2
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2169,6 +2169,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 2320 | [Count Number of Ways to Place Houses](https://leetcode.com/problems/count-number-of-ways-to-place-houses/) | [无] | [C++](2001-2500/2320-Count-Number-of-Ways-to-Place-Houses/cpp-2320/) | | |
 | 2321 | [Maximum Score Of Spliced Array](https://leetcode.com/problems/maximum-score-of-spliced-array/) | [无] | [C++](2001-2500/2321-Maximum-Score-Of-Spliced-Array/cpp-2321/) | | |
 | 2322 | [Minimum Score After Removals on a Tree](https://leetcode.com/problems/minimum-score-after-removals-on-a-tree/) | [无] | [C++](2001-2500/2322-Minimum-Score-After-Removals-on-a-Tree/cpp-2322/) | | |
+| 2323 | [Find Minimum Time to Finish All Jobs II](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii/) | [无] | [C++](2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
