문제 링크입니다: https://www.acmicpc.net/problem/15235 15235번: Olympiad Pizza The contestants that get a slice are, in order: 1, 2, 3, 4, 2, 4, 2, 4, 4. So at t=1s the first contestant get all slices, at t=3s the third contestant gets a slice, at t=7s the second student finishes and finally at t=9s the fourth student gets the last s www.acmicpc.net 간단한 큐 구현 문제였습니다. N의 최댓값이 1,000이기 때문에 단순 구현으로 풀 수 있는 문제..