int findKMin(int[] L,int n,int k){ int low,high,pivot,flag,tail; low = 1,high = n; do{ while(low<high){ flag = low; tail = high; pivot = L[low]; while(low<high&&L[high]>=pivot) high--; L[low] = L[high]; while(low<high&&L[low]<pivot) low++; L[high] = L[low]; } L[low] = pivot; if(low-flag==k-1) break; else if(low-flag<k-1){ low++; high = tail; k -= low; }else{ high = low-1; low = flag; } }while(1); return L[low]; }