2323 new algo added.

liuyubobobo · liuyubobobo · commit 177af591414b · 2022-07-01T00:58:19.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
@@ -3,4 +3,4 @@ project(cpp_2323)
 
 set(CMAKE_CXX_STANDARD 14)
 
-add_executable(cpp_2323 main.cpp)
+add_executable(cpp_2323 main2.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
@@ -9,7 +9,7 @@
 using namespace std;
 
 
-/// Binary Search
+/// Binary Search + Greedy
 /// Time Complexity: O(nlogn + nlog(max_jobs))
 /// Space Complexity: O(1)
 class Solution {
diff --git a/2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/main2.cpp b/2001-2500/2323-Find-Minimum-Time-to-Finish-All-Jobs-II/cpp-2323/main2.cpp
@@ -0,0 +1,37 @@
+/// Source : https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii/
+/// Author : liuyubobobo
+/// Time   : 2022-07-01
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+
+/// Greedy
+/// Time Complexity: O(nlogn)
+/// 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 res = 0;
+        for(int i = 0; i < jobs.size(); i ++)
+            res = max(res, jobs[i] / workers[i] + !!(jobs[i] % workers[i]));
+        return res;
+    }
+};
+
+
+int main() {
+
+    vector<int> jobs1 = {5, 2, 4}, workers1 = {1, 7, 5};
+    cout << Solution().minimumTime(jobs1, workers1) << '\n';
+    // 2
+
+    return 0;
+}

Original file line number	Diff line number	Diff line change
`@@ -3,4 +3,4 @@ project(cpp_2323)`
`3`	`3`
`4`	`4`	`set(CMAKE_CXX_STANDARD 14)`
`5`	`5`
`6`		`-add_executable(cpp_2323 main.cpp)`
	`6`	`+add_executable(cpp_2323 main2.cpp)`