POJ 1788 Building a New Depot G++

#include <iostream>
#include <cstdio>
#include <algorithm> 
using namespace std;
//英语   看博友分析    抄博友程序 
struct nod{
	int x;
	int y;
}da[10010];
bool cmp1(nod a, nod b)
{
	if(a.x==b.x)
	{
		return a.y<b.y;
	}else
	{
		return a.x<b.x;
	}
}
bool cmp2(nod a, nod b)
{
	if(a.y==b.y)
	{
		return a.x<b.x;
	}else 
	{
		return a.y<b.y;
	}
}
int main()
{
	int n;
	while(cin>>n)
	{
		if(n==0)
		{
			break;
		}
		for(int i=0;i<n;i++)
		{
			cin>>da[i].x>>da[i].y;
		}
		sort(da,da+n,cmp1);
		int ans=0;
		for(int i=0;i<n-1;i=i+2)//抄博友程序
		{
			if(da[i].x==da[i+1].x)
			{
				ans=ans+da[i+1].y-da[i].y;
			}
		}
		sort(da,da+n,cmp2);
		for(int i=0;i<n-1;i=i+2)
		{
			if(da[i].y==da[i+1].y)
			{
				ans=ans+da[i+1].x-da[i].x;
			}
		}
		cout<<"The length of the fence will be "<<ans<<" units."<<endl;
	}
	return 0;
}