计算几何 ural 1207 Median on the Plane

极角排序，选个基准点，然后取中点的序号跟P[0]的序号

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long llt;
#define SIZE 100010
struct point_t{
	llt x,y;
	int nub;
}P[SIZE];
//叉积，OA×OB
llt cross(point_t const&O,point_t const&A,point_t const&B){
    llt xoa = A.x - O.x;
	llt yoa = A.y - O.y;
	llt xob = B.x - O.x;
	llt yob = B.y - O.y;
	return xoa * yob - xob * yoa;
}
//A如果比B更靠下更靠左返回真
bool isLowLeft(point_t const&A,point_t const&B){
	return A.y < B.y || ( A.y == B.y && A.x < B.x );
}

//按照对于pO的极角排序，极角相等的距离远的排在前面，因为后面要做一个unique
point_t* pO;
bool comp4Graham(point_t const&A,point_t const&B){
    llt t = cross(*pO,A,B);
	if ( t ) return t > 0LL;

	llt a1 = A.x > pO->x ? A.x - pO->x : pO->x - A.x;
	llt a2 = B.x > pO->x ? B.x - pO->x : pO->x - B.x;
    if ( a1 != a2