C++ array sorting problem. we are going to take N numbers and a "k" value from the user and sort them. we will return kth number to the user. Do it this way: First, store the first k numbers in array. Then, sort this array in decreasing order. Read the rest of the numbers one by one -- Ignore if it is smaller than the number at kth position --otherwise, insert it in its correct position and shift the remaing numbers (the number at the kth position will be thrown away) Return the number at index k-1 of the array