Submission

Status:

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

Score: 100

User: ShynyC

Problemset: ลอดสะพาน

Language: cpp

Time: 0.003 second

Submitted On: 2025-04-19 22:34:13

#include <iostream>
#include <vector>
using namespace std;

int main(){
    int l,n,a,b,count = 0, max = 0;
    pair<int,int> bridge;
    vector<pair<int,int> > bridges;
    cin >> l >> n;
    for(int i = 0; i < n; i++){
        cin >> a >> b;
        bridge.first = a;
        bridge.second = b;
        bridges.push_back(bridge);
    }
    for(float i = 0.5; i < l; i = i + 0.5){
        for(int j = 0; j < n; j++){
            if(bridges[j].first < i && bridges[j].second > i){
                count++;
            }
        }
        if(count > max){
            max = count;
        }
        count = 0;
    }
    cout << max;
}