100分 hack点WA 玄关求调

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
long long n,m,school[N],sk=1;
priority_queue<long long,vector<long long>,greater<long long> > score;
long long ans=0;
int main(){
	cin>>m>>n;
	for(int i=1;i<=m;i++){
			cin>>school[i];
		}
	for(int i=1;i<=n;i++){
		int x;cin>>x;
		score.push(x);
	}
	sort(school+1,school+m+1);
	for(int i=1;i<=n;i++){
		long long a=score.top(),p=abs(school[sk]-a);
		score.pop();
		while(abs(a-school[sk+1])<=p){
			sk++;
			p=abs(school[sk]-a);
		}
		ans+=p;
	}
	cout<<ans<<endl;
}