Good Bye 2018 B. New Year and the Treasure Geolocation(思维)stl的使用pair , make_pair

题意是要去找宝藏，给出了n个坐标，又给了n个方向向量，现在要让坐标和向量两两配对，使得配对后的n个点都指向同一个点(xi+ai,yi+bi)，输出这个点(有多个满足条件的点，输出一个就好)。

我的思路是n*n去把每个点都求出来，然后找出现过n次的坐标，方法不唯一，别人也有求和比较最值的方法。

#include <iostream>
#include <algorithm> 
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <functional>
const int INF=0x3f3f3f3f;
const int maxn=3e5+10; 
const int mod=1e9+7;
const int MOD=998244353;
const double eps=1e-7;
typedef long long ll;
#define vi vector<int> 
#define si set<int>
#define pii pair<int,int> 
#define pi acos(-1.0)
#define pb push_back
//#define mp make_pair
#define lowbit(x) (x&(-x))
#define sci(x) scanf("%d",&(x))
#define scll(x) scanf("%I64d",&(x))
#define sclf(x) scanf("%lf",&(x))
#define pri(x) printf("%d",(x))
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define mem(a,b) memset(a,b,sizeof(a)) 
using namespace std;
//int a[maxn],b[maxn];
struct Node
{
    int x, y;

}Edge[maxn];
struct node
{
    int x, y;
}edge[maxn];

typedef pair<int,int> p;
map<p,int> mp;

int n ;
int main(){
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> Edge[i].x >> Edge[i].y;
    }
    int ans_x ,ans_y;
    //bool flag = 0;
    for(int i = 1; i <= n ; i ++){
        cin >> edge[i].x >> edge[i].y;
        for(int j = 1; j <= n ; j++){
           int xx = Edge[j].x + edge[i].x;
            int yy = Edge[j].y + edge[i].y;
            mp[p(xx,yy)] ++;
            if(mp[p(xx,yy)] == n) {
                ans_x = xx;
                ans_y = yy;
                goto out;
                //break;
            }
        }
    }
    out :
    cout << ans_x << " " << ans_y << endl;
    return 0;
}