Submission

Score: 100

User: C12

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

Language: cpp

Time: 0.015 second

Submitted On: 2026-03-05 21:24:22

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

#define ll long long

int v[2*int(1e7)+1] = {0};

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    ll n;
    cin >> n;
    
    ll mx = 0;
    ll mn = 2*int(1e7)+1;
    ll l,r;
    ll sum = 0;
    for(ll i = 0; i < n;i++){
        cin >> l >> r;
        
        if(l > r) swap(l,r);
        
        mn = min(mn,l);
        mx = max(mx,r);
        
        v[l]++;
        v[r]--;
        sum += r-l;
    }

    ll now = 0;
    ll cnt = 0;
    sum /= 2;
    
    // if(sum == 0){
    //     cout << 0;
    //     return 0;
    // }

    for(ll i = mn;i <= mx;i++){
        now += v[i];
        cnt += now;

        if(cnt >= sum){
            cout << i;
            return 0;
        }
    }
    
    return 0;
}