OJ Board

Code: Select all

#include <math.h>
#include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>

using namespace std;

class point
{
	public:
		double x, y;
};

bool tosortby_x(const point p1, const point p2)
{
	return(p1.x > p2.x);
}

bool tosortby_y(const point p1, const point p2)
{
	return(p1.y > p2.y);
}

int main()
{
	int n;
	double A, B, H;
	vector<point> points;
	point aux;
	while(true)
	{
		cin>>n;
		if(n == 0) break;
		points.clear();
		for(int i = 0; i < n; i++)
		{
			cin>>aux.x>>aux.y;
			points.push_back(aux);
		}
		sort(points.begin(), points.end(), tosortby_x);
		B = fabs(points[0].x - points[points.size()-1].x);
		sort(points.begin(), points.end(), tosortby_y);
		H = fabs(points[0].y - points[points.size()-1].y);
		A = B*H;
		printf("%.3f\n", A);
	}
	return 0;
}