Don't copy other wrongs answer. If you copy and search this question in Chegg, you will get the wrong solution. DON"T COPY!!!!!!

On n parallel railway tracks n trains are going with constant speeds v1, v2, ..., vn. At time t = 0 the trains are at positions k1, k2, ..., kn. Give an O(nlogn) algorithm that detects all trains that at some moment in time are leading. To this end, use the algorithm for computing the intersection of half-planes.