For this Question: You are given N line segments on the number line. Each segment is denoted by two integers L and R (L <= R), denoting the start and end points of the segment. 
You need to find the maximum number of segments overlapping at a point. More clearly, if you find the number of segments passing the point for all points on the number line, you need to report the maximum value obtained in the process.

Note: Even if segments overlap at the end points, it is considered an overlap.

See sample for better understanding.The first line of the input contains an integer N, the number of segments.
The next N line contain two space separated integers L and R, the end points of the i<sup>th</sup> segment.

Constraints
1 <= N <= 200000
0 <= L <= R <= 200000Output a single integer, the maximum number of segments overlapping at a point.Sample Input
3
1 3
2 4
3 5

Sample Output
3

Explanation: All the segments overlap at the point 3.

Sample Input
2
1 5 
7 11

Sample Output
1, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;


const int N = 2e5+5;

// it's swapnil07 ;)
 
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif


void solve(){
    vector<int> cur(200002, 0);
    int n; cin>>n;
    For(i, 0, n){
        int l, r; cin>>l>>r;
        cur[l]++;
        cur[r+1]--;
    }
    int ans = cur[0];
    For(i, 1, sz(cur)){
        cur[i]+=cur[i-1];
        ans = max(ans, cur[i]);
    }
    cout<<ans;
}


signed main()
{
    fast
    #ifdef SWAPNIL07
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif
    int t=1; 
    // cin>>t;
    while(t--){
        solve();
        cout<<"\n";
    }
    return 0;
}

, In this Programming Language: C++, Now tell me if this Code is compilable or not?