Given the locations of CSCE 2202 students on campus, write an algorithm that would find the two students that are closest to each other. Assume the location of one student is given as only one coordinate (x) on a flat line that represents the map of AUC. The distance between any two students is simply the squared difference of their coordinates. Also assume that all values of x are positive integers.

write a c++ code