Submission

Score: 100

User: exoworldgd

Problemset: ลอดสะพาน

Language: cpp

Time: 0.002 second

Submitted On: 2025-05-24 17:03:18

#include <bits/stdc++.h>
using namespace std;
int main(void) {
    int n,m; cin >> n >> m;
    int a[n+1];
    memset(a,0,sizeof(a));
    while(m--) {int l,r; cin >> l >>r,a[l]++,a[r]--;}
    for (int i = 1; i <= n; i++) a[i] += a[i-1];
    int mx = *max_element(a,a+n);
    cout << mx;
}