tjut 4311

最新推荐文章于 2019-01-27 21:10:00 发布

Change_ZHONG

最新推荐文章于 2019-01-27 21:10:00 发布

阅读量172

点赞数

分类专栏：曼哈顿距离

本文链接：https://blog.csdn.net/luozhong11/article/details/52083552

版权

曼哈顿距离专栏收录该内容

0 篇文章 0 订阅

订阅专栏

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <algorithm>  
using namespace std;  
  
typedef long long LL;  
const int maxn = 1e5+10;  
  
struct point{  
    int x,y;  
    LL sum;  
}p[maxn];  
  
bool cmp1(point A,point B)  
{  
    if(A.x<B.x) return true;  
    if(A.x==B.x&&A.y<B.y) return true;  
    return false;  
}  
  
bool cmp2(point A,point B)  
{  
    if(A.y<B.y) return true;  
    if(A.y==B.y&&A.y<B.y) return true;  
    return false;  
}  
  
  
int main()  
{  
    int t,n;  
    scanf("%d",&t);  
    while(t--){  
        scanf("%d",&n);  
        LL sum=0;  
        for(int i=1;i<=n;i++){  
            scanf("%d%d",&p[i].x,&p[i].y);  
            p[i].sum=0;  
        }  
        sort(p+1, p+1+n, cmp1);  
        for (LL i = 1; i <= n; ++i) {  
            p[i].sum += (i-1) * p[i].x - sum;  
            sum += p[i].x;  
        }  
        sum = 0;  
        for (LL i = n; i >= 1; --i) {  
            p[i].sum += sum - (n-i) * p[i].x;  
            sum += p[i].x;  
        }  
        sum = 0;  
        sort(p+1, p+1+n, cmp2);  
        for (LL i = 1; i <= n; ++i) {  
            p[i].sum += (i-1) * p[i].y -sum;  
            sum += p[i].y;  
        }  
        sum = 0;  
        LL ans = 1LL<<62;  
        for (LL i = n; i >= 1; --i) {  
            p[i].sum += sum - (n-i) * p[i].y;  
            ans = min(ans, p[i].sum);  
            sum += p[i].y;  
        }  
        printf("%I64d\n",ans);  
    }  
    return 0;  
}