Can someone please convert this Pseudocode to working C++ code for closestPair() for O(n logn)?

ALGORITHM EfficientClosestPair(P, Q) //Solves the closest-pair problem by divide-and-conquer //Input: An array P of n 2 points in the Cartesian plane sorted in nondecreasing order of their x coordinates and an array Q of the same points sorted in nondecreasing order of the y coordinates //Output: Euclidean distance between the closest pair of points if n