codeforces 831D

题意： 一条路上有一个重点站和n个人（n个点），k把钥匙。开始想的比较复杂，后来发现第i个人拿了第j把钥匙，第i+1不会拿小于j的钥匙，计算发现，后者会导致不必要的cost增大。所以就yy了一个简单的贪心，将a和b排序，遍历1到k-n+1,每次n把钥匙的最大值进行比较。

“`

include

include

include

include

include

include

include

include

include

include

include

include

include

include

include

include

include

using namespace std;
typedef long long ll;

define maxn 2010

ll a[maxn];
ll b[maxn];
int main()
{
ll n,k,p;
cin >>n >> k>>p;
ll i,j;
for (i=1;i<=n;i++){
cin >> a[i];
}
for (i=1;i<=k;i++){
cin >> b[i];
}
sort (a+1,a+1+n);
sort(b+1, b+1+k);
ll ans = 1e18;
for (i=1;i<=k-n+1;i++){
ll maxs = 0;
for (j=1;j<=n;j++){
ll res = abs(a[j]-b[i+j-1])+abs(p - b[i+j-1]);
maxs = max (res, maxs);
}
ans = min (maxs, ans);
}
cout << ans<