因为每个点一定连右下的点，而且距离是曼哈顿距离 所以顺序是无所谓的 那么直接算就可以了
#include<iostream>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
#define MAXN 1010
#define MAXM 1010
#define ll long long
#define eps 1e-8
#define MOD 1000000007
#define INF 1000000000
int n;
ll ans;
int main(){
int i,x,y;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d",&x,&y);
ans-=x;
ans+=y;
}
for(i=1;i<=n;i++){
scanf("%d%d",&x,&y);
ans+=x;
ans-=y;
}
printf("%lld\n",ans);
return 0;
}
/*
*/
转载请注明原文地址: https://ju.6miu.com/read-18614.html
