排序查找4之篱笆计算

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
struct point
{
	int x,y;
}
c[1000002];
bool cmp1(point a,point b)
{
	if(a.y==b.y)
	return a.x<b.x;
	return a.y<b.y;
}
bool cmp2(point a,point b)
{
	if(a.x==b.x) 
	return a.y<b.y;
	return a.x<b.x;
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)break;
		int i,j,k;
		for(i=0;i<n;i++)
		{
			scanf("%d %d",&c[i].x,&c[i].y);
		}
		sort(c,c+n,cmp1);
	    int sum=0;
		for(j=0;j<n;j=j+2)
		{
			sum=sum+(c[j+1].x-c[j].x);
		}
		sort(c,c+n,cmp2);
		for(k=0;k<n;k=k+2)
		{
			sum=sum+(c[k+1].y-c[k].y);
		}
		printf("The length of the fence will be %d units.\n",sum);  	
	}
	return 0;
}

建立结构体的应用 在快排上按结构体设定的排序方法排序 后通过计算算出长度