Submission

Score: 50

User: Brook

Problemset: ห้องสมุดเมือง 3M

Language: cpp

Time: 0.293 second

Submitted On: 2026-03-09 21:29:40

#include <iostream>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;


int main(){
	int n;
	cin>>n;
	vector<pair<int,int>> room(n);
	for(int i=0;i<n;i++){
		int a,b;
		cin>>a>>b;
		room[i]={a,b};
	}
	priority_queue<int,vector<int>,greater<int>> pq; 
	for(int i=0;i<n;i++){
		for(int j=room[i].first;j<room[i].second;j++){
			pq.push(j);
		}
	}
	
	int t=pq.size()/2;
	for(int i=0;i<(t-1);i++){
		pq.pop();
	}
	if(!pq.empty()){
		cout<<pq.top();
	}
	return 0;
}