매일 C++ day 2

2021-05-19

디스크 컨트롤러

https://programmers.co.kr/learn/courses/30/lessons/42627

```c++ #include #include #include

using namespace std;

bool cmp(vector a, vector b) { return a[1] < b[1]; }

int findOne(vector<vector> jobs, int time) { for(int i=0; i<jobs.size(); i++) { if(jobs[i][0] <= time) return i; } return -1; }

int solution(vector<vector> jobs) { int answer = 0, time = 0, length = jobs.size(); sort(jobs.begin(), jobs.end(), cmp);

while(1)
{
    if(jobs.empty()) break;
    int done = findOne(jobs, time);

    if(done == -1) time +=1;
    else
    {
        answer += jobs[done][1] - jobs[done][0] + time;
        time += jobs[done][1];
        jobs.erase(jobs.begin()+done);
    }
}


return answer/length; }```

test test