问题 A: Cakey McCakeFace

Cakey McCakeFace’s signature pastry, the Unknowable Cake, is baked daily in their Paris facility.
The make-or-break trick for this cake is the cooking time, which is a very well-kept secret. Eve, the well-known spy, wants to steal this secret, and your job is to help her.
Cakes are cooked in a single huge oven that has exactly one front and one back door. The uncooked cakes are inserted through the front door. After the exact and very secret cooking time has passed, the cakes exit the oven through the back door. Only one cake can go through the front or back door at any given time.
Eve has secretly installed detectors at the front and back of the oven. They record a signal every time a cake passes through the doors. A cake will therefore trigger the entry detector at some time t when it goes through the front door, and then trigger the exit detector at time exactly t + cooking_time when it goes through the back door (all cakes at Cakey McCakeFace are always perfectly cooked).
After a few days, she receives two sets of timestamps (in ms) corresponding to entry and exit detectors. Unfortunately, the detectors  are faulty: they are sometimes triggered when no cake has passed, or they may fail to be triggered when a cake passes. Eve noticed that she could make a good guess of the secret cooking_time by finding the time difference that maximizes the number of  correspondences of entry and exit detection times. Help Eve compute this.

输入

• Line 1: the number N of times the entry detector was triggered.
• Line 2: the number M of times the exit detector was triggered.
• Line 3: the N integer timestamps at which the entry detector was triggered, sorted in ascending
order, with no repetition, space-separated.
• Line 4: the M integer timestamps at which the exit detector was triggered, sorted in ascending
order, with no repetition, space-separated.
Limits
• 1≤N, M≤2 000;
• each timestamp is between 0 and 1 000 000 000 (inclusive).

输出

A single integer: your best guess of the secret cooking_time, the (positive or zero) time difference that maximizes the number of correspondences of entry and exit detection times. If multiple such values exist, the smallest one should be returned.

样例输入

5

5

0 10 12 20 30

1 5 17 27 50

样例输出

5

题意：记录蛋糕进烤箱以及出烤箱的时间点，但是记录时间点的设备有故障，可能没有蛋糕的时候记录了，可能有蛋糕的时候没记录，第一个数是记录了几次入口的时间点，第二个数是记录了几次出口的时间点，让你输出一个蛋糕完全烤好所需要的时间

★两行数不是对应的，求差值，哪一个差值出现的次数最多，如果一样多，输出最小的，可以输出0.

★这里用到了不定长数组 vector，不然容易内存超限

AC代码：

#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
vector<long long int> c;//定义不定长数组vector
int main()
{
    long long int n,m;
    long long int a[2005],b[2005];
    scanf("%lld%lld",&n,&m);
    long long int i,j;
    for(i=0; i<n; i++)
        scanf("%lld",&a[i]);
    for(i=0; i<m; i++)
        scanf("%lld",&b[i]);
    for(i=0; i<n; i++)
        for(j=0; j<m; j++)
        {
            if(b[j]>=a[i])
                c.push_back((b[j]-a[i]));//将出现的差值放入数组中
        }
    sort(c.begin(),c.end());//给数组排序（vector数组排序的套路），用来后面统计差值出现的次数
    j=0;
    long long int k=1,sum=0,t=c.size(); //c.size()读取大小
    for(i=0; i<t-1; i++)
    {
        if(c[i]==c[i+1])
            k++;
        else
        {
            if(k>sum)
            {
                sum=k;
                j=c[i];//用j记录出现次数最多的差值
            }
            k=1;//一个差值统计结束，k重新初始化，来统计下一个
        }
    }
    printf("%lld\n",j);
    return 0;
}