ZOJ-2352

水，凸包都已经给出来了，不用求直接极角排序就可以了

#include<iostream>
#include<sstream>
#include<vector>
#include<algorithm>

using namespace std;

namespace
{
	inline int cross(const pair<int, int> &p1, const pair<int, int> &p2)
	{
		return p1.first * p2.second - p1.second * p2.first;
	}

	bool cmp(const pair<int, int> &p1, const pair<int, int> &p2)
	{
		return cross(p1, p2) > 0;
	}
}

int main()
{
	int N, x, y;
	cin >> N >> ws;
	string s;
	vector<pair<int, int> > V;
	for (int t = 0; t < N; t++)
	{
		if (t)
			cout << endl;
		V.clear();
		while (getline(cin, s), cin && s != "")
		{
			istringstream is(s);
			is >> x >> y;
			if (x || y)
				V.push_back(make_pair(x, y));
		}
		sort(V.begin(), V.end(), cmp);
		cout << "(0,0)" << endl;
		for (size_t i = 0; i < V.size(); i++)
			cout << '(' << V[i].first << ',' << V[i].second << ')' << endl;
	}
	return 0;
}