Round-Robin Printer — Solution & Editorial
Job K finishes on its pK-th pass. Jobs before K in the cycle get min(pi, pK) pages by then; jobs after K get min(pi, pK−1). Sum plus pK itself — pure counting, no simulation.
Complexity: O(N)
Watch out: Per-page simulation is O(total pages) = 109 — count each job's contribution in O(1) instead.