Submission

Score: 0

User: achinhchin

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-25 11:02:39

#include<iostream>
#include<map>
#include<utility>
using namespace std;
typedef long long l;
#define pl pair<l,l>
#define plp pair<l,pl>
#define f first
#define s second
pl D[]={{0,1},{1,1},{0,-1},{-1,1},{1,0},{-1,-1},{-1,0},{1,-1}};
l i,j,k,n,m,a,b,c=1,d,sm,mx,mn;
map<l,l> A;
int main() {
  cin.tie(nullptr)->sync_with_stdio(0);
  cin>>n;
  while(n--)cin>>a>>b,A[a]++,A[b]--,sm+=b-a; sm/=2; d=(*A.begin()).s;
  //cout<<'\n';
  //for(auto i:A) cout<<i.f<<' '<<i.s<<'\n';
  //cout<<sm;
  //cout<<'\n';
  for(auto i=++A.begin();i!=A.end();i++){
    //cout<<i->f<<' '<<i->s<<':'<<c<<' '<<d<<'\n';
    if(c+d*(i->f-prev(i)->f)>=sm){
      cout<<prev(i)->f+(sm-c)/d;break;
    }c+=d*(i->f-prev(i)->f), d+=i->s;
  }
}