Greetings, aspiring coders! Today, we're going to delve deep into the complexities of data structures, specifically the SortedList, and explore how to handle queries efficiently. This is a common problem, often encountered in numerous data science and algorithmic problems. So let's gear up to unravel the mysteries of SortedList operations, and get our hands dirty with some interactive problem solving!

Before delving into the task, let's understand what a SortedList is and why we would use it. SortedList is a data structure from the sortedcontainers Python module. As the name suggests, it keeps the data sorted in an ascending order after every insertion or deletion.

Advantages of using SortedList:

1. Extracting minimum (sorted_list[0]) or maximum (sorted_list[-1]) values will be a constant time operation, i.e., $O(1)$ as they are always at the start or end of the list.