Submission

Score: 0

User: Phat12

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-03 10:40:43

/*
TASK: c2_ds66_3m.cpp
LANG: C++
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
using namespace std;
int arr[20001000];
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int mx=0;
    int cnt=0;
    for (int i=0;i<n;i++){
        int a,b;
        cin >> a >> b;
        arr[a]++;
        arr[b]--;
        cnt+=(b-a);
        mx = max(mx,b);
    }
    for (int i=1;i<mx;i++){
        arr[i]+=arr[i-1];
    }
    // for (int i=0;i<mx;i++){
    //     cout <<  arr[i] << ' ';
    // }
    int cnt2=0;
    for (int i=0;mx;i++){
        cnt2+=arr[i];
        if (cnt2 >= cnt/2) {
            cout << i;
            break;
        }
    }

    return 0;
}