HDU计算机学院大学生程序设计竞赛（2015’12）1003 The collector’s puzzle

#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
const int N=20005;
int n,k,m;
int l[N],r[N];
int v[10*N],s[N];
int main()
{
    int i,j;
    int T;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(l,0,sizeof(l));
        memset(r,0,sizeof(r));
        memset(v,0,sizeof(v));
        memset(s,0,sizeof(s));
        for(i=1;i<=n;i++)
        {
            scanf("%d",&v[i]);
        }
        while(m--)
        {
            scanf("%d",&i);
            s[i]=1;
        }
        int now=-10000;
        for(i=1;i<=10000;i++)
        {
            if(s[i]) now=i;
            l[i]=i-now;
        }
        now=30000;
        for(i=10000;i>=1;i--)
        {
            if(s[i]) now=i;
            r[i]=now-i;
        }
        long long ans=0;
        for(i=1;i<=n;i++)
        {
            ans+=min(r[v[i]],l[v[i]]);
        }
        cout<<ans<<endl;

    }
    return 0;
}