## Central Point (April 2011)

Given a set of N integer points on the Cartesian plane. Your task is to find an integer point satisfying its sum of distances to N given points (S) is minimum.

Input

There are several test cases (fifteen at most), each formed as follows:

The first line contains a positive integer N (N ≤ 2,000).

N lines follow, each […]

## Recent Comments