POJ 1788 Building a New Depot 解题报告

 1 #include<stdio.h>
 2 #include<algorithm>
 3 #include<math.h>
 4 using namespace std;
 5 struct weizhi{
 6     int x;
 7     int y;
 8 }a[200000];
 9 bool cmp1(weizhi a,weizhi b)
10 {
11     if(a.x==b.x)
12         return a.y<b.y;
13     return a.x<b.x;
14 }
15 bool cmp2(weizhi a,weizhi b)
16 {
17     if(a.y==b.y)
18         return a.x<b.x;
19     return a.y<b.y;
20 }
21 int main()
22 {
23     long int n;
24     while(scanf("%d",&n)!=EOF)
25     {
26         if(n==0)break;
27         int i;
28         for(i=0;i<n;i++)
29         {
30             scanf("%d %d",&a[i].x,&a[i].y);
31         }
32         int sum=0;
33         sort(a,a+n,cmp1);
34         for(i=0;i<n;i+=2)
35         {
36             sum+=a[i+1].y-a[i].y;
37         }
38         sort(a,a+n,cmp2);
39         for(i=0;i<n;i+=2)
40         {
41             sum+=a[i+1].x-a[i].x;
42         }
43         printf("The length of the fence will be %d units.\n",sum);
44     }
45     return 0;
46 }