Submission

Score: 0

User: erng

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-02-27 21:24:58

#include <bits/stdc++.h>

using namespace std;

#define ll long long
int n;
ll a, b, k, t, pva, pvb, cua, cub, pv, ca, sz;
priority_queue<tuple<ll,ll,ll>, vector<tuple<ll,ll,ll>>, greater<tuple<ll,ll,ll>>> pq;


int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>a>>b;
        k+=b-a;
        sz=b-a;
        pq.push({a, sz, i});
    }
    k=k/2;
    while (1)
    {
        auto [f, l, q]=pq.top();
        pq.pop();
        if (t+l<k)
        {
            t+=l;
        }
        else
        {
            a=q;
            cua=f;
            break;
        }
    }
    cout<<cua+k-t-1;
}