Given points on plane, the points forms a convex polygon. You need to find points among them, then we calculate the convex hull of the points.
You need to maximize .
First line contains two integers .
Each of the next lines contains two integers , represent a point.
It's guaranteed no two points coincide.
One float number, represent the answer, round to 4 decimal digits. It's guaranteed the output will not change if we add to the answer or subtract from the answer.
Note : The statement for this problem has been updated. We are rejudging all submissions, please check announcement on contest page for detailed issue.
The sample is in the above graph. .