[ 프로그래머스 C++ ] 선입 선출 스케줄링 lv3

< 해설 >

해설 스킵

 

< 문제 >

 

< 풀이 >

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(int n, vector<int> cores) {
    int lo = 1, hi = 100000000;
    
    while(lo+1 < hi)
    {
        int mid = (lo+hi)/2;
        int work = 0;
        vector<int> memo;
        for(int i = 0; i < cores.size(); ++i)
        {
            work += mid/cores[i] + 1;
            
            if(mid % cores[i] == 0)
            {
                memo.push_back(i);
                work -= 1;
            }
        }
        
        if(work >= n)
            hi = mid - 1;
        else if(work + memo.size() < n)
            lo = mid + 1;
        else
            return memo[n - work - 1] + 1;
    }
}