16692번 - Greedy Scheduler 다국어

A store has n cashiers numbered sequentially from 1 to n, with c customers in a queue. A customer at the front of the queue is constantly assigned to the first unoccupied cashier, i.e., cashier with the smallest number. The ith customer’s shopping cart takes t_i seconds to process.

Find which cashier will process each customer’s shopping cart.

The first line of input contains two space-separated integers n and c (1 ≤ n ≤ c ≤ 1000). The second line of input contains c space-separated integers t₁, . . . , t_c (1 ≤ t_i ≤ 1,000), representing the length of time required to handle that customer.

Output a single line containing c space-separated integers, each with the cashier number that handles that customer.