Good Bye 2018 B. New Year and the Treasure Geolocation(思维)

#include <bits/stdc++.h>
#define maxn 1005
using namespace std;
struct Node{
	int x,y;
}Edge[maxn];
struct node{
	int x,y;
}edge[maxn];
typedef pair<int,int> p;
map<pair<int,int>,int> Map;
int n;

int main()
{
  scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d%d",&Edge[i].x,&Edge[i].y);
	}
	int ans_x, ans_y;
	for(int i=0;i<n;i++){
		scanf("%d%d",&edge[i].x,&edge[i].y);
		for(int j=0;j<n;j++){
			int xx = Edge[j].x + edge[i].x;
			int yy = Edge[j].y + edge[i].y;
			Map[p(xx,yy)] ++;
			if(Map[p(xx,yy)] == n){
				ans_x = xx;
				ans_y = yy;
			}
		}
	}
	cout<<ans_x<<" "<<ans_y<<endl;
  return 0;
}