NYOJ7 街区最短路径问题

 1 #include<cstdio>

 2 #include<iostream>

 3 #include<vector>

 4 using namespace std;

 5 int locx[25],locy[25];

 6 int main()

 7 {

 8     int N,i,j,n,ans;

 9     scanf("%d",&N);

10     while(N--){

11         scanf("%d",&n);

12         for(i=0;i<n;i++)

13             scanf("%d%d",&locx[i],&locy[i]);

14         sort(locx,locx+n,less<int>());

15         sort(locy,locy+n,less<int>());

16         for(ans=i=0,j=n-1;i<j;i++,j--)

17             ans+=locx[j]-locx[i]+locy[j]-locy[i];

18         printf("%d\n",ans);

19     }

20     return 0;

21 }

中位数水题