Submission

[PPPPP][PPPPP][PPPPPPPPPP]

Score: 100

User: devilpoohs

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

Language: cpp

Time: 0.007 second

Submitted On: 2025-03-23 07:23:47

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

bool comp(pair<int,int> a,pair<int,int> b){
    if(a.first!=b.first)    return a.first<b.first;
    return a.second<b.second;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    pair<int,int> ar[2*n];
    int u,v;
    int sum=0;
    for(int i=0;i<2*n;i+=2){
        cin>>u>>v;
        ar[i].first=u;
        ar[i].second=1;
        ar[i+1].first=v;
        ar[i+1].second=-1;
        sum+=(v-u);
    }
    sort(ar,ar+2*n,comp);
    int count=0;
    int idx=0;
    int buak=0;
    int mean=sum/2;
    while(true){
        int cur=ar[idx].first;
        int s=ar[idx].first;
        while(cur==ar[idx].first){
            buak+=ar[idx].second;
            idx++;
        }
        while(s<ar[idx].first){
            s++;
            count+=buak;
            if(count>=mean){
                cout<<s-1;
                return 0;
            }
        }
        
    }
    return 0;
}