Submission

Status:

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

Score: 100

User: njoop

Problemset: ลอดสะพาน

Language: cpp

Time: 0.002 second

Submitted On: 2024-11-30 22:12:26

#include <bits/stdc++.h>

using namespace std;

int n, l, ans;
pair<int, int> arr[1000];

int main() {
    cin >> l >> n;
    for(int i=1; i<=n; i++) {
        cin >> arr[i].first >> arr[i].second;
    }
    for(int i=1; i<=l; i++) {
        int t=0;
        for(int j=1; j<=n; j++) {
            if(arr[j].first <= i && arr[j].second > i) t++;
        }
        ans = max(ans, t);
    }
    cout << ans;
}