dp[i][j] 第一维表示people,第二维表示key
当i==j的时候,刚好每个人对应一把钥匙
当i!=j的时候,分两种情况,i去拿j,和i不用拿j
所以代码如下
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define mem(i,a) memset(i,a,sizeof(i))
#define rson mid+1,r,rt<<1|1
#define lson l,mid,rt<<1
#define ll long long
#define LL long long
using namespace std;
template <typename T>inline void read(T &_x_){
_x_=0;bool f=false;char ch=getchar();
while (ch<'0'||ch>'9') {if (ch=='-') f=!f;ch=getchar();}
while ('0'<=ch&&ch<='9') {_x_=_x_*10+ch-'0';ch=getchar();}
if(f) _x_=-_x_;
}
const double eps = 0.0000001;
const int maxn = 2e3+7;
const int mod = 1e9+7;
int n,k,p;
int a[maxn],b[maxn];
int dp[maxn][maxn];
int main(){
read(n),read(k),read(p);
FOR(i,1,n) scanf("%d",&a[i]);
sort(a+1,a+1+n);
FOR(i,1,k) scanf("%d",&b[i]);
sort(b+1,b+1+k);
FOR(i,1,n){
FOR(j,i,k){
if(i==j){
dp[i][j]=max(dp[i-1][j-1],abs(a[i]-b[j])+abs(b[j]-p));
continue;
}
dp[i][j]=min(dp[i][j-1], max(dp[i-1][j-1],abs(a[i]-b[j])+abs(b[j]-p)));
}
}
int ans=0x7fffffff;
FOR(i,n,k) ans=min(ans,dp[n][i]);
printf("%d\n",ans);
return 0;
}