ACM Southwestern European Regional Programming Contest (SWERC) 2017 A map+暴力

//暴力+map的应用
#include <iostream>
#include<cstdio>
#include<cstring>
#include<map>
using namespace std;
typedef long long LL;
const int maxn=2000+5;
map<LL,int>str;
int main()
{
    int n,m;
    scanf("%d",&n);
    scanf("%d",&m);
    int a[maxn],b[maxn];
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    for(int i=0;i<m;i++)
        {
            scanf("%d",&b[i]);
            for(int j=0;j<n;j++)
            {
                if(b[i]>=a[j]) str[b[i]-a[j]]++;
                else break;
            }
        }
    map<LL,int>::iterator it;
    int temp=0;
    LL ans;
    for(it=str.begin();it!=str.end();it++)
    {
        if(temp<it->second) {
                temp=it->second;
                ans=it->first;
        }
    }
    cout<<ans<<endl;
    str.clear();
    return 0;
}