Lifeguards

#include<bits/stdc++.h>
using namespace std;

int arr[101][3];

void solve(){
    int n;
    scanf("%d",&n);

    for(int i=1;i<=n;i++){
        scanf("%d %d",&arr[i][1],&arr[i][2]);
    }

    int ans=0;
    for(int i=1;i<=n;i++){
        set<int>se;
        for(int j=1;j<=n;j++){
            if(i==j) continue;

            for(int x = arr[j][1]+1 ;x<= arr[j][2] ;x++){
                se.insert(x);
            }

        }
        ans = max(ans, (int)se.size());
    }
    printf("%d\n",ans);
}

int main()
{
    freopen("lifeguards.in", "r", stdin);
    freopen("lifeguards.out", "w", stdout);
    int tc=1;
    //scanf("%d",&tc);

    while(tc--){
        solve();
    }
}