Submission

Score: 0

User: okazagiFragment

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-10 20:51:31

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define okazaki cin.tie(nullptr)->sync_with_stdio(0),cout.tie(0);
#define pii pair<int,int>
#define tii tuple<int,int,int>
const int maxn=1000001;
int n,m,x,q;
signed main(void) {
	cin>>n;
	vector<pii> iv(n);
	int sum=0;
	for(auto&[l,r]:iv){
		cin>>l>>r;
		r--;
		sum+=(r-l+1);
	}
	int k=sum/2+1;
	int l=0,r=20000000,ans;
	while(l<r){
		int mid=l+(r-l)/2;
	
		int cnt=0;
		for(auto&[a,b]:iv){
			if(a<=mid){
				cnt+=(min(b,mid)-a+1);
			}
		}
		if(cnt<k){
			l=mid+1;
		}
		else{	
			r=mid;
		}     
	}
	cout<<r;
}