80分求debug

#include <stdio.h>

void q_sort(int *arr,int start,int end){
    if(start >= end){
        return;
    }
    int left = start;
    int right = end;
    int pivot = arr[left];
    while(left < right){
        while(arr[right] > pivot && left < right){
            right--;
        }
        if(left < right){
            arr[left] = arr[right];
            left++;
        }
        while(arr[left] < pivot && left < right){
            left++;
        }
        if(left < right){
            arr[right] = arr[left];
            right--;
        }
        
    }
    arr[left] = pivot;
    q_sort(arr,start,left-1);
    q_sort(arr,left+1,end);
}

int main(){
    int n,k,count = 1;
    int num[10001],unique[10001];
    scanf("%d%d",&n,&k);
    for(int i = 1;i <= n;i++){
        scanf("%d",&num[i]);
    }
    q_sort(num,1,n);
    for(int i = 1;i <= n;i++){
        if(num[i+1] != num[i]){
            unique[count++] = num[i];
        }
    }
    if(count < k){
        printf("NO RESULT");
    }
    else{
        printf("%d",unique[k]);
    }
    return 0;
}