Submission

Score: 100

User: AugusEiEi

Problemset: ลอดสะพาน

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-23 15:41:03

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

int main(){
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n,k;cin>>n>>k;
  vector<pair<int,int>>line;
  for(int i=0;i<k;i++){
    int a,b;cin>>a>>b;
    line.emplace_back(a,1);
    line.emplace_back(b,-1);
  }
  sort(line.begin(),line.end());
  int mx=-1,cnt=0;
  for(int i=0;i<2*k;i++){
    if(line[i].second==1) cnt++;
    else cnt--;
    mx=max(mx,cnt);
  }
  cout<<mx;
}