Problem B - Airline Hub

Problem B - Airline Hub

时间： 1ms        内存：128M

描述：

Problem B - Airline Hub

World Wide Flyer has landing rights at several airports throughout the world. They wish to place their central hub at the airport that minimizes the maximum direct flying distance from the hub to any other airport in the world.

Input consists of a line containing n <= 1000, the number of airports. n lines follow, each giving the latitude (between -90 and +90 degrees) and longitude (between -180 and +180 degrees) of an airport.

To two decimal places, give the latitude and longitude of the airport that best serves as a hub. If there are several any one will do.

输入：

输出：

示例输入：

3
3.2 -15.0
20.1 -175
-30.2 10

示例输出：

3.20 -15.00

提示：

参考答案：

解锁文章

没有看到答案？微信扫描二维码可免费解锁文章

使用微信扫描二维码打开广告页面后可以立即关闭，再刷新此页面即可正常浏览此文章

所跳转广告均由第三方提供，并不代表本站观点！

已经扫描此二维码？点此立即跳转

文章解锁成功，即将自动跳转，点此立即跳转