docs: public static final long[] findLargestItemIndexes(double[] values, int n) {
      long[] heapKeys = new long[n + 1];
      double[] heapValues = new double[n + 1];
      int heapSize = 0;
  
      for (int i = 0; i < values.length; i++) {
        offer(heapKeys, heapValues, heapSize, i, values[i]);
        heapSize++;
  
        if (heapSize > n) {
          removeMin(heapKeys, heapValues, heapSize);
          heapSize--;
        }
      }
  
      long[] returnKeys = new long[heapSize];
      while (heapSize > 0) {
        returnKeys[heapSize - 1] = heapKeys[0];
        removeMin(heapKeys, heapValues, heapSize);
        heapSize--;
      }
      return returnKeys;
    }