1 solutions

  • 0
    @ 2025-12-3 17:06:18

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    int n,a,b,w[1000006],ans;
    int main()
    {
    	cin>>n;
    	while(n--)
    	{
    		cin>>a>>b;
    		w[a]++;
    		w[b+1]--;
    	}
    	for(int i=1;i<=1000000;i++)
    	{
    		w[i]+=w[i-1];
    		ans=max(ans,w[i]);
    	}
    	cout<<ans;
        return 0;
    }
    
    • 1

    Information

    ID
    953
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    10
    Tags
    # Submissions
    1
    Accepted
    1
    Uploaded By