POJ 1723

 1 #include <iostream>
 2 #include <algorithm>
 3 #define MAXN 10005
 4 using namespace std;
 5 
 6 struct node
 7 {
 8     int x;
 9     int y;
10 };
11 
12 node _node[MAXN];
13 
14 bool op_x(node a,node b)
15 {
16     if(a.x < b.x)
17     {
18         return true;
19     }
20     return false;
21 }
22 
23 bool op_y(node a,node b)
24 {
25     if(a.y < b.y)
26     {
27         return true;
28     }
29     return false;
30 }
31 
32 
33 int main()
34 {
35     //freopen("acm.acm","r",stdin);
36     int n;
37     int i;
38     int sum_y = 0;
39     int sum_x = 0;
40     while(cin>>n)
41     {
42         sum_x = 0;
43         sum_y = 0;
44         for(i = 0; i < n; ++ i)
45         {
46             cin>>_node[i].x>>_node[i].y;
47         }
48         sort(_node,_node+n,op_y);
49         for(i = 0; i < n/2; ++ i)
50         {
51             sum_y += abs(_node[i].y - _node[n-i-1].y);
52         }
53 
54         sort(_node,_node+n,op_x);
55 
56         for(i = 0; i < n; ++ i)
57         {
58             _node[i].x -= i;
59         }
60         
61         sort(_node,_node+n,op_x);
62 
63         for(i = 0; i < n/2; ++ i)
64         {
65             sum_x += abs(_node[i].x - _node[n-i-1].x);
66         }
67         cout<<sum_x + sum_y<<endl;
68     }
69 }