Codeforces 831D Office Keys(思维or二分)

• • 
    
  • D. Office Keys

    time limit per test

    2 seconds

    memory limit per test

    256 megabytes

    input

    standard input

    output

    standard output

    There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key and then go to the office. Once a key is taken by somebody, it couldn't be taken by anybody else.

    You are to determine the minimum time needed for all n people to get to the office with keys. Assume that people move a unit distance per 1 second. If two people reach a key at the same time, only one of them can take the key. A person can pass through a point with a key without taking it.

    Input

    The first line contains three integers n, k and p (1 ≤ n ≤ 1 000, n ≤ k ≤ 2 000, 1 ≤ p ≤ 109) — the number of people, the number of keys and the office location.

    The second line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 109) — positions in which people are located initially. The positions are given in arbitrary order.

    The third line contains k distinct integers b1, b2, ..., bk (1 ≤ bj ≤ 109) — positions of the keys. The positions are given in arbitrary order.

    Note that there can't be more than one person or more than one key in the same point. A person and a key can be located in the same point.

    Output

    Print the minimum time (in seconds) needed for all n to reach the office with keys.

    Examples

    input

    2 4 50
    20 100
    60 10 40 80
    

    output

    50
    

    input

    1 2 10
    11
    15 7
    

    output

    7
    

    Note

    In the first example the person located at point 20 should take the key located at point 40 and go with it to the office located at point 50. He spends 30 seconds. The person located at point 100 can take the key located at point 80 and go to the office with it. He spends 50seconds. Thus, after 50 seconds everybody is in office with keys.

    
    

    题意：
  • 
    
  • 一个坐标轴上有n个人，他们坐标分别为 a[1...n] ，而且有k把钥匙坐标分别在 b[1...k] ，现在办公室们在坐标为p的位置，每个人必须要拿到唯一一把钥匙进入办公室们，不同人之间不能共用，问你所有人进入办公室的最短时间是多少？

分析:

每个人需要拿最靠左的钥匙。但是不知道怎么证明

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2005;
ll a[maxn], b[maxn];
int main()
{
    int n, k, p;
    scanf("%d%d%d", &n, &k, &p);
    for(int i = 1; i <= n; i++)
        scanf("%I64d", &a[i]);
    for(int i = 1; i <= k; i++)
        scanf("%I64d", &b[i]);
    sort(a+1, a+n+1);
    sort(b+1, b+k+1);
    ll ans = 1e18;
    for(int i = 1; i <= k-n+1; i++)
    {
        int delta = i - 1;
        ll ma = 0;
        for(int j = 1; j <= n; j++)
            ma = max(ma, abs(a[j] - b[j+delta]) + abs(b[j+delta] - p));
        ans = min(ans, ma);
    }
    printf("%I64d\n", ans);
    return 0;
}