80分WA求调

#include<bits/stdc++.h>
using namespace std;
int a[1000100],n,k,b[1000100],ans=0;
int main(){
    cin>>k;
    for(int i=1;i<=k;i++){
        int l,r,x=1;
        cin>>l>>r;
        b[l]+=x;
        b[r+1]-=x;
    }
    for(int i=0;i<=1000000;i++){
        b[i]=b[i-1]+b[i];
        if(ans<=b[i]) ans=b[i];
    }
    cout<<ans;
    return 0;
}