Submission

Score: 100

User: mmpk

Problemset: ลอดสะพาน

Language: cpp

Time: 0.004 second

Submitted On: 2026-07-24 16:43:19

#include<bits/stdc++.h>
using namespace std;
int l[309];
int r[309];
int main(){
  int y,n;cin>>y>>n;
  for(int i=0;i<n;i++){
    cin>>l[i];
    cin>>r[i];
  }
int mx=0;
for(double i=0;i<y;i+=0.5){
  int cnt=0;
  for(int j=0;j<n;j++){
    if(i>l[j]&&i<r[j]){
      cnt++;
    }
  }
  if(mx<cnt){
    mx=cnt;
  }
}  
  
cout<<mx;  
  
}