🐜 Study: 선입 선출 스케줄링

Author: ing-eoking

ing-eoking/선입 선출 스케줄링.cc

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+typedef pair<int, int> PAIR;
+
+int solution(int n, vector<int> cores) {
+    long long work;
+    int N = cores.size();
+    if (n <= N) return n;
+    int bot = 0, mid, top = n * 10000 + 1;
+    while (bot < top) {
+        work = 0;
+        mid = (bot + top) / 2;
+        for (int c : cores) work += (long long)(mid / c + 1);
+        if (work >= n) top = mid;
+        else bot = mid + 1;
+    }
+
+    work = 0;
+    for (int c : cores) work += (long long)(top / c + 1);
+
+    while (true) {
+        for (int i = N - 1; i >= 0; i--) {
+            if (top % cores[i] == 0) {
+                work--;
+                if (work == n - 1) return i + 1;
+            }
+        }
+        top--;
+    }
+    return 0;
+}