62分

#include<bits/stdc++.h>
using namespace std;
const int N=5005;
int n;
struct E{
	int a,b;
}e[N];
int C(E x,E y){
	return x.a!=y.a?x.a<y.a:x.b<y.b;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>e[i].a>>e[i].b;
	}
	sort(e+1,e+n+1,C);
	int s=0,s1=0,s2=0,ans1=0,ans2=0,f=0;
	for(int i=1;i<=n;i++){
		f=max(f,e[i].b);
	}
	for(int i=1;i<=n;i++){
		e[i].b-e[i].a;
		if(e[i-1].b>=e[i].a){
			s1+=e[i].b-e[i-1].b;
			ans2=max(ans2,s2);
			s2=0;
		}else{
			if(i!=1){
				s2+=e[i].a-e[i-1].b;
				ans1=max(ans1,s1);
			}
			s1=e[i].b-e[i].a;
		}
		if(e[i].b==f){
			break;
		}
	}
	cout<<max(ans1,s1)<<" "<<max(ans2,s2);
	return 0;
}