CUDA and C++, take array input and fill table by ordering it

Hi, I am looking for a helper for the following project. For the implementation we will rely as a starting point on the parallel sort matching that I have already implemented (For Input, Output e Algorithm). Basically we will have as input two arrays representing the Lower Bound and Upper Bound of the segments to be analyzed. You will have to take those data as input and put them in a new array indicating in the first row the coordinates of the X regarding Lower and Upper bound, in the second row a wording L or U if it is lower or upper bound and in the third row which of the segments we are considering. At that point you will simply have to sort the matrix according to the values of the first row in ascending order. Also I would need the implementation using the Thrust library, so very simple as an implementation. The implementation will be done in CUDA programming (exploiting the GPU for the large computation of the incoming data and speeding up the process). This is the first step I need. For this step I offer 100 euros. If the result is good, I can continue with another 2 additional steps always paid. For the execution of this simple step you will have 7 days. Obviously I will give you an implementation example of what I ask and the parallel program that I have created on which you will have to base yourself as a methodology. I need a very experienced CUDA and C ++ / C programmer, given the importance of the work. Thank you