Queues of a supermarket (2)

Simulate the behavior of the queues of a supermarket. Initially, there
are n queues (1, 2, …, n), each one with some customers. Afterwards, two
events can happen:

- A costumer arrives to a queue: If the queue is between 1 and n, the
  customer goes to the end of that queue. Otherwise, the event is
  ignored.

- A customer leaves a queue: If the queue is between 1 and n, and that
  queue is not empty, the oldest customer of that queue leaves it.
  Otherwise, the event is ignored.

Input

Input starts with the number of queues n (a strictly positive natural
number). Follow n lines, one per queue, each one with its customers (a
word) and their ages (a real number). Follow an empty line and the
description of several events, one per line: the word “ENTERS” followed
by the customer, the customer’s age, and the queue; or the word “LEAVES”
followed by the queue. All the customers have different ages.

Output

First, print the name of the customers that leave the queues, in the
order that they departed. Afterwards, print the final content of the n
queues, using the order in which the customers would leave. Follow the
format of the example.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T11:59:55.448Z

© Jutge.org, 2006–2026.
https://jutge.org
