https://cn.vjudge.net/problem/CodeForces-1000C
#include<iostream>
#include<algorithm>
using namespace std;
const int N=500005;
typedef long long ll;
pair<ll,ll>e[N];
ll f[N];
int main(){
int cnt=0;
int n;cin>>n;
for(int i=0;i<n;i++){
ll l,r;
cin>>l>>r;
e[++cnt]={l,1};
e[++cnt]={r+1,-1};
}
sort(e+1,e+1+cnt);
int sum=e[1].second;
for(int i=2;i<=cnt;i++){
f[sum]+=e[i].first-e[i-1].first;
sum+=e[i].second;
}
for(int i=1;i<=n;i++) cout<<f[i]<<' ';
cout<<endl;
return 0;
}