hdu 4311（枚举）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4311

思路：只会最简单的暴力枚举，枚举n/2的附近点即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define MAXN 100010
typedef long long ll;
#define inf (1ll)<<60
int n;
struct Node{
   int x,y;
}node[MAXN];

int cmp(const Node &p,const Node &q){
   if(p.x!=q.x)return p.x<q.x;
   return p.y<q.y;
}

ll Solve(int k){
   ll ans=0;
   for(int i=1;i<=n;i++){
      ans+=abs(node[k].x-node[i].x);
      ans+=abs(node[k].y-node[i].y);
   }
   return ans;
}


int main(){
   int _case;
 //  freopen("1.txt","r",stdin);
   scanf("%d",&_case);
   while(_case--){
      scanf("%d",&n);
      for(int i=1;i<=n;i++){
         scanf("%d%d",&node[i].x,&node[i].y);
      }
      sort(node+1,node+1+n,cmp);
      ll sum=inf;
      int st=(n/2-333<1?1:n/2-333);
      int ed=(n/2+333>n?n:n/2+333);
      for(int i=st;i<=ed;i++){
         ll ans=Solve(i);
         sum=min(ans,sum);
      }
      printf("%I64d\n",sum);
   }
   return 0;
}