Submission

Score: 100

User: FotoFatTurtle

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

Language: cpp

Time: 0.011 second

Submitted On: 2025-03-19 22:17:34

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int num,fi,se,nub=0;
    cin>>num;
    int jum=0,st=2e9;
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> dp;
    for(int i=0;i<num;i++)
    {
        cin>>fi>>se;
        jum+=(se-fi);
        dp.push({fi,1});
        dp.push({se,-1});
        st=min(fi,st);
    }
    jum/=2;
    int perm=0;
    for(int i=st;i<21000000;i++)
    {
        while(dp.top().f==i)
        {
            perm+=dp.top().s;
            dp.pop();
        }
        jum-=perm;
        if(jum<=0)
        {
            cout<<i;
            return 0;
        }
    }
}