Codeforces Round #404 (Div. 2) B题

B. Anton and Classes
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

题意：分别给n和m个区间，求区间直接的最大距离，距离定义为两个区间之间最近的点。如果区间相交，距离为0

解法：先对n个区间右端点（r1）sort和m个区间的左端点（l2）sort，那么最大距离是r1[n]-l2[1]，再对n个区间的左端点(l1)和m个区间的右端点(r2)sort，最大距离在r2[n]-l1[1]

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=200005;
int l1[N],r1[N];
int l2[N],r2[N];
int main()
{
    int n,m;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d%d",&l1[i],&r1[i]);
    scanf("%d",&m);
    for(int i=1;i<=m;i++) scanf("%d%d",&l2[i],&r2[i]);
    sort(r1+1,r1+n+1);
    sort(l2+1,l2+m+1);
    int ans = l2[m]-r1[1];
    sort(l1+1,l1+n+1);
    sort(r2+1,r2+m+1);
    ans=max(ans,l1[n]-r2[1]);
    if(ans>0)printf("%d\n",ans);
    else puts("0");
    return 0;
}