Finding the Closest Pair in C++

Given a set of 8 points, the closest-pair problem is to find the two points that are nearest to each other. Here is a sample run:

Enter 8 points: -1 3 -1 -1 1 1 2 0.5 2 -1 3 3 4 2 4 -0.5

The closest two points are (1, 1) and (2, 0.5)