求助24分史无前例

#include<bits/stdc++.h>
using namespace std;
struct COWS{
    int s , e;
}cows[5010];
int leastone[5010] , nobody[5010];
int main(){
    int n , lo = 1 , nb = 1 , lof = 0 , loe , nof , noe;
    bool a = true;
    cin >> n;
    cin >> cows[1].s >> cows[1].e;
    for(int i = 2; i <= n + 1; i++){
        if(i != n + 1) cin >> cows[i].s >> cows[i].e;
        if(a){
            lof = cows[i - 1].s;
            a = false;
            continue;
        }
        if(cows[i].s <= cows[i - 1].e){
            if(i != n + 1){
                continue;
            } else {
                loe = cows[i].e;
                leastone[lo] = loe - lof;
                lo++;
            }
        } else {
            loe = cows[i - 1].e;
            leastone[lo] = loe - lof;
            lo++;
            a = true;
            nof = cows[i - 1].e;
            noe = cows[i].s;
            nobody[nb] = noe - nof;
            nb++;
        }
    }
    loe = cows[n].e;
    leastone[lo] = loe - lof;
    lo++;
    sort(leastone + 1 , leastone + lo + 1);
    sort(nobody + 1 , nobody + nb + 1);
    cout << leastone[lo] << " " << nobody[nb];
}