Luogu 1678

题目分析：

• 给每个学生匹配不满意度最小的学校

Code:

#include <bits/stdc++.h>
using namespace std;
#define maxn 100010
#define maxm 100010

int ans=0,n,m,a[maxn],b;

inline int read_() {
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9') {
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9') {
		x=(x<<1)+(x<<3)+c-'0';
		c=getchar();
	}
	return x*f;
}

inline void work_(int x) {
	int pdc=lower_bound(a,a+n,x)-a;
	int mind=1000000007;
	mind=min(mind,abs(a[pdc]-x));
	if(pdc>0) mind=min(mind,abs(a[pdc-1]-x));
	ans+=mind;
}

void readda_() {
	n=read_();m=read_();
	for(int i=0;i<n;++i) {
		a[i]=read_();
	}
	sort(a,a+n);
	for(int i=0;i<m;++i) {
		b=read_();
		work_(b);
	}
	printf("%d",ans); 
}

int main() {
	freopen("a.txt","r",stdin);
    readda_();
    return 0;
}