Seat reservation

A movie theater has $N$ seats numbered $1$ to $N$

Build a seat reservation system that performs one of the

following operations $K$ times:

Fetches the smallest$-$numbered unreserved seat then

reserves it and retums its number

Cancels a seat feservation for seat$[$i$].$

The result should be an array containing the reserved seat

numbers.

Notes

If seat $[2]=0,$ reserve the seat

If seat$[\frac{?}{\text{b}\text{a}\text{r}}(d)]>0,$ cancel the reservation of a seat

Type here to search