Submission

Score: 0

User: Korticz

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

Language: cpp

Time: 0.050 second

Submitted On: 2026-03-11 15:40:02

#include<bits/stdc++.h>
using namespace std;
#define ll long long

vector<int> v(20000002);
int a,b,k,mx=0,total=0;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin>>k;
    while(k--) {
        cin>>a>>b;
        v[a]++;
        v[b]--;
        mx=max(mx,b);
        total+=b-a;
    }
    for (int i=1;i<mx+2;i++) {
        v[i]+=v[i-1];
    }
    for (int i=1;i<mx+2;i++) {
        v[i]+=v[i-1];
        //cout<<v[i]<<" ";
    }
    //cout<<'\n';
    auto it=lower_bound(v.begin(),v.begin()+mx+2,total/2)-v.begin();
    cout<<it;
    return 0;
}