https://kelly-chui.github.io/algorithmtags/priority-queue/Recent content in Priority Queue on Kelly DevHugoen-usSat, 02 Aug 2025 00:00:00 +0000https://kelly-chui.github.io/ps/2025/ps-programmers-disk-controller/Sat, 02 Aug 2025 00:00:00 +0000https://kelly-chui.github.io/ps/2025/ps-programmers-disk-controller/<h2 id="문제">문제</h2> <p><a href="https://school.programmers.co.kr/learn/courses/30/lessons/42627">https://school.programmers.co.kr/learn/courses/30/lessons/42627</a></p> <h2 id="풀이">풀이</h2> <p>우선 순위대로 문제를 처리하므로 힙을 써야하는 것은 명확하다. 하지만, 이 힙을 어떻게 다루느냐가 더 중요한 문제이기 때문에 사실상 힙보다는 단순 구현 문제에 가깝다.</p> <h3 id="코드">코드</h3> <div class="code-theme-github"><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-py" data-lang="py"><span class="line"><span class="cl"><span class="kn">import</span> <span class="nn">heapq</span> </span></span><span class="line"><span class="cl"> </span></span><span class="line"><span class="cl"><span class="k">def</span> <span class="nf">solution</span><span class="p">(</span><span class="n">jobs</span><span class="p">):</span> </span></span><span class="line"><span class="cl"> <span class="n">jobs</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">key</span> <span class="o">=</span> <span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="n">x</span><span class="p">[</span><span class="mi">0</span><span class="p">])</span> </span></span><span class="line"><span class="cl"> <span class="n">waitQueue</span> <span class="o">=</span> <span class="p">[]</span> </span></span><span class="line"><span class="cl"> <span class="n">finished</span> <span class="o">=</span> <span class="mi">0</span> </span></span><span class="line"><span class="cl"> <span class="n">currentTime</span> <span class="o">=</span> <span class="mi">0</span> </span></span><span class="line"><span class="cl"> <span class="n">jobIdx</span> <span class="o">=</span> <span class="mi">0</span> </span></span><span class="line"><span class="cl"> <span class="n">totalReturnTime</span> <span class="o">=</span> <span class="mi">0</span> </span></span><span class="line"><span class="cl"> <span class="k">while</span> <span class="n">finished</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">jobs</span><span class="p">):</span> </span></span><span class="line"><span class="cl"> <span class="k">while</span> <span class="n">jobIdx</span> <span class="o">&lt;</span> <span class="nb">len</span><span class="p">(</span><span class="n">jobs</span><span class="p">)</span> <span class="ow">and</span> <span class="n">jobs</span><span class="p">[</span><span class="n">jobIdx</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span> <span class="o">&lt;=</span> <span class="n">currentTime</span><span class="p">:</span> </span></span><span class="line"><span class="cl"> <span class="n">requestTime</span><span class="p">,</span> <span class="n">duration</span> <span class="o">=</span> <span class="n">jobs</span><span class="p">[</span><span class="n">jobIdx</span><span class="p">]</span> </span></span><span class="line"><span class="cl"> <span class="n">heapq</span><span class="o">.</span><span class="n">heappush</span><span class="p">(</span><span class="n">waitQueue</span><span class="p">,</span> <span class="p">(</span><span class="n">duration</span><span class="p">,</span> <span class="n">requestTime</span><span class="p">))</span> </span></span><span class="line"><span class="cl"> <span class="n">jobIdx</span> <span class="o">+=</span> <span class="mi">1</span> </span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="n">waitQueue</span><span class="p">:</span> </span></span><span class="line"><span class="cl"> <span class="n">duration</span><span class="p">,</span> <span class="n">requestTime</span> <span class="o">=</span> <span class="n">heapq</span><span class="o">.</span><span class="n">heappop</span><span class="p">(</span><span class="n">waitQueue</span><span class="p">)</span> </span></span><span class="line"><span class="cl"> <span class="n">currentTime</span> <span class="o">+=</span> <span class="n">duration</span> </span></span><span class="line"><span class="cl"> <span class="n">returnTime</span> <span class="o">=</span> <span class="n">currentTime</span> <span class="o">-</span> <span class="n">requestTime</span> </span></span><span class="line"><span class="cl"> <span class="n">totalReturnTime</span> <span class="o">+=</span> <span class="n">returnTime</span> </span></span><span class="line"><span class="cl"> <span class="n">finished</span> <span class="o">+=</span> <span class="mi">1</span> </span></span><span class="line"><span class="cl"> <span class="k">else</span><span class="p">:</span> </span></span><span class="line"><span class="cl"> <span class="n">currentTime</span> <span class="o">=</span> <span class="n">jobs</span><span class="p">[</span><span class="n">jobIdx</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span> </span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">totalReturnTime</span> <span class="o">//</span> <span class="nb">len</span><span class="p">(</span><span class="n">jobs</span><span class="p">)</span></span></span></code></pre></div></div>