Search for the K-th small number in the quick rank
# Include "iostream. h "using namespace std; int findMedian (int * A, int left, int right) {int center = (left + right)/2; if (A [left]> A [center]) {swap (A [left], A [center]);} if (A [left]> A [right]) {swap (A [left], A [right]);} if (A [center]> A [right]) {swap (A [center], A [right]);} // A [right] is greater than A [center] swap (A [center], A [right-1]); return A [right-1];} void insertSort (int * A, int left, int right) {for (int I = left + 1; I <= right; I ++) {int p = A [I]; int j; for (j = I; j> = left & A [J-1]> p; j --) {A [j] = A [J-1];} A [j] = p ;}# define CUTOFF 5int qselect (int * A, int k, int left, int right) {if (left + CUTOFF
Else) {} if (I
= Accept & A [j] <= accept, swap (A [I], A [j]);} else break;} swap (A [I], A [right-1]); int t = I-left + 1; if (k = t) return A [I]; else if (k
> N; for (int I = 0; I
> A [I];} int k; cin> k; if (k <= N-0) cout <