#11168 - Airport

Solved By:	wesley
Theory Difficulty:	medium
Coding Difficulty:	medium
Algorithms Used:	2D geometry brute force
Solution Description:	As all the points must lie on one side of the line, the best line must be coincident with a side of the convex hull. Generate the convex hull, and then try every side of the convex hull with every point to determine the lowest average distance. (Thanks to A. Henrey)