Submission #344461

---

Source Code Expand

#include<iostream>
#include<utility>
#include<vector>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define IN 0
#define OUT 1

vector<pair<int, int> > customer;

int main(void){
	int n,a,b,c=0,result=0;
	cin >> n;
	customer.reserve(2 * n);
	rep(i, 0, n){
		cin >> a >> b;
		auto s = make_pair(a, IN);
		auto t = make_pair(b, OUT);
		customer.push_back(s);
		customer.push_back(t);
	}
	sort(customer.begin(), customer.end());
	rep(i, 0u, customer.size()){
		if (customer[i].second == IN)result=max(result,++c);
		else c--;
	}
	cout << result <<  endl;
	return(0);
}

Submission Info

Judge Result