Submission

Status:

[PP][PP][PP][PP][PP][PP][PP][PP][PP][PP]

Score: 100

User: Winzzwz

Problemset: ลอดสะพาน

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-05 13:52:51

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int l,n,mx,t[330];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> l >> n;
    for (int i = 1; i <= n; i++) {
        int a,b; cin >> a >> b;
        t[a]++;
        t[b]--;
    }
    for (int i = 1; i <= l; i++) {
        t[i] += t[i-1];
        mx = max(mx,t[i]);
        //cout << t[i] << " ";
    }
    cout << mx;

    return 0;
}