摘要：快排思想O(N)求第k大数 int quicksort(int l,int r,int k) { int midv = a[(l+r)>>1]; int i = l,j = r; while(i <= j) { while(a[i] < midv)i++; while(a[j] > midv)j-- 阅读全文