Submission

Score: 20

User: VggT

Problemset: ลอดสะพาน

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-17 14:19:52

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int l, n;
	cin >> l >> n;
	vector<pair<int,int>> vec(n);
	map<int,int> m;
	
	for(int i = 0; i < n; i++)
	{
		int num1, num2;
		cin >> num1 >> num2;
		
		for(int j = num1; j <= num2; j+=1) m[j]+=1;
	}
	
	int nmax = INT_MIN;
	
	for(auto l : m) nmax = max(nmax,l.second);
	
	cout << nmax;
	
	
	
	
	return 0;
}