挤牛奶Milking Cows

#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<iomanip>
using namespace std;
struct node
{
    int begin,end;
}p[5005];
bool cmp(node a,node b)
{
    return a.begin<b.begin;
}
int n,max1,max2,head,tail;
int main()
{
    ios::sync_with_stdio(false);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].begin>>p[i].end;
    }
    sort(p+1,p+1+n,cmp);
    head=p[1].begin,tail=p[1].end;
    for(int i=2;i<=n;i++)
    {
        if(p[i].begin<=tail)tail=max(tail,p[i].end);
        else
        {
            max1=max(max1,tail-head);
            max2=max(max2,p[i].begin-tail);
            head=p[i].begin,tail=p[i].end;
        }
    }
    max1=max(max1,tail-head);
    cout<<max1<<" "<<max2;
    return 0;
}