codefores 785B. Anton and Classes（排序）

Anton likes to play chess. Also he likes to do programming. No wonder that he decided to attend chess classes and programming classes.

Anton has n variants when he will attend chess classes, i-th variant is given by a period of time (l1, i, r1, i). Also he has m variants when he will attend programming classes, i-th variant is given by a period of time (l2, i, r2, i).

Anton needs to choose exactly one of n possible periods of time when he will attend chess classes and exactly one of m possible periods of time when he will attend programming classes. He wants to have a rest between classes, so from all the possible pairs of the periods he wants to choose the one where the distance between the periods is maximal.

The distance between periods (l1, r1) and (l2, r2) is the minimal possible distance between a point in the first period and a point in the second period, that is the minimal possible |i - j|, where l1 ≤ i ≤ r1 and l2 ≤ j ≤ r2. In particular, when the periods intersect, the distance between them is 0.

Anton wants to know how much time his rest between the classes will last in the best case. Help Anton and find this number!
Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of time periods when Anton can attend chess classes.

Each of the following n lines of the input contains two integers l1, i and r1, i (1 ≤ l1, i ≤ r1, i ≤ 109) — the i-th variant of a period of time when Anton can attend chess classes.

The following line of the input contains a single integer m (1 ≤ m ≤ 200 000) — the number of time periods when Anton can attend programming classes.

Each of the following m lines of the input contains two integers l2, i and r2, i (1 ≤ l2, i ≤ r2, i ≤ 109) — the i-th variant of a period of time when Anton can attend programming classes.
Output

Output one integer — the maximal possible distance between time periods.
Examples
Input

3
1 5
2 6
2 3
2
2 4
6 8

Output

3

Input

3
1 5
2 6
3 7
2
2 4
1 4

Output

0

Note

In the first sample Anton can attend chess classes in the period (2, 3) and attend programming classes in the period (6, 8). It’s not hard to see that in this case the distance between the periods will be equal to 3.

In the second sample if he chooses any pair of periods, they will intersect. So the answer is 0.

题目大意：

有两个学习班开了一些课程，Anton必须在两个学习班各上一节课，但是他想在两堂课之间的休息时间最长，你能帮帮选出这个最长的休息时间是多少吗？如果中间没有休息时间，输出0

解题思路：

两趟排序，分别按照开始时间的升序和结束时间的降序排一下，然后拿一个学习班的最后一个课堂的开始时间减去另一个学习班的第一个课堂的结束时间。因为是要求绝对值，所以反过来再重复一遍，选出较大的就行了。

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
    long long x,y;
}a[200005],b[200005];

long long cmp1(node a,node b)
{
    return a.x<b.x;
}

long long cmp2(node a,node b)
{
    return a.y>b.y;
}

int main()
{
    long long i,n,m;
    while(cin>>n)
    {
        for(i=0;i<n;i++)
          cin>>a[i].x>>a[i].y;
        cin>>m;
        long long ans,sum;
        for(i=0;i<m;i++)
          cin>>b[i].x>>b[i].y;
        sort(a,a+n,cmp2);
        sort(b,b+m,cmp1);
        ans=b[m-1].x-a[n-1].y;
        sort(a,a+n,cmp1);
        sort(b,b+m,cmp2);
        sum=a[n-1].x-b[m-1].y;
        if(ans<sum)
          ans=sum;
        if(ans<0)
          ans=0;
        cout<<ans<<endl;
    }
    return 0;
}