疑问 Leetcode 215. 数组中的第K个最大元素 堆缓存访问溢出

原本的想法是使用大顶堆，但是提示堆缓存访问溢出，然后我不会看报错信息= =
AddressSanitizer: heap-buffer-overflow on address 0x603000000028 at pc 0x000000401996 bp 0x7fff9eefa330 sp 0x7fff9eefa328

=================================================================
==30==ERROR: AddressSanitizer: heap-buffer-overflow on address 0x603000000028 at pc 0x000000401996 bp 0x7fff9eefa330 sp 0x7fff9eefa328
READ of size 4 at 0x603000000028 thread T0
    #3 0x7f7ce16162e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)

0x603000000028 is located 0 bytes to the right of 24-byte region [0x603000000010,0x603000000028)
allocated by thread T0 here:
    #0 0x7f7ce2aa02b0 in malloc (/usr/local/lib64/libasan.so.5+0xe82b0)
    #3 0x7f7ce16162e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)

Shadow bytes around the buggy address:
  0x0c067fff7fb0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c067fff7fc0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c067fff7fd0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c067fff7fe0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
  0x0c067fff7ff0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
=>0x0c067fff8000: fa fa 00 00 00[fa]fa fa fa fa fa fa fa fa fa fa
  0x0c067fff8010: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c067fff8020: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c067fff8030: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c067fff8040: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
  0x0c067fff8050: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
Shadow byte legend (one shadow byte represents 8 application bytes):
  Addressable:           00
  Partially addressable: 01 02 03 04 05 06 07 
  Heap left redzone:       fa
  Freed heap region:       fd
  Stack left redzone:      f1
  Stack mid redzone:       f2
  Stack right redzone:     f3
  Stack after return:      f5
  Stack use after scope:   f8
  Global redzone:          f9
  Global init order:       f6
  Poisoned by user:        f7
  Container overflow:      fc
  Array cookie:            ac
  Intra object redzone:    bb
  ASan internal:           fe
  Left alloca redzone:     ca
  Right alloca redzone:    cb
==30==ABORTING

代码如下：

//本函数完成在数组R[low]到R[high]范围内对在位置low上的节点进行调整

void Sift(int R[],int low,int high)//因R[]中是一颗完全二叉树，所以关键字的存储必须从1开始
{
    int i = low ,j = 2 * i;
    int temp = R[i];
    while(j <= high)
    {
        if(j < high && R[j] < R[j + 1])
            ++j;
        if(temp < R[j])
        {
            R[i] = R[j];
            i = j;
            j = 2 * i;
        }
        else 
            break;
    }
    R[i] = temp;
}

//堆排序函数
int findKthLargest(int R[], int n, int k){
    int i ;
    int temp;
    for(int i = n / 2 ; i >= 1;--i)//建立初始堆
        Sift(R,i,n);
    for(i = n;i >= 2;--i)
    {
        //以下3句换出了根节点中的关键字，将其放入最终位置
        temp = R[1];
        R[1] = R[i];
        R[i] = temp;
        Sift(R,1,i-1);
    }
    
    return(R[k]);
}