title: Time complexity of operations on a sorted array of sorted lists
body: <p>I have a sorted array of N elements equally distributed in K lists that is also sorted. What will be the time complexity (in tightest Big-O notation) for:</p>
  
  <ol>
  <li>Removing the smallest element.</li>
  <li>Resorting array after the removal of the smallest element.</li>
  <li>Removing all N elements</li>
  </ol>
  
  <p>For the first part, I thought the answer is <code>O(1)</code> since the smallest element is the first element. But the list that it's a part of need not be the first list and so I am unsure.</p>
  
  <p>For the second part, I am not sure (maybe <code>O(NK)</code>?)</p>
  
  <p>For the third part, it has to be <code>O(N)</code> since we're going through the entire array but, again, I am unsure</p>