Submission

[P-SSS][SSSSS][SSSSSSSSSS]

Score: 0

User: devilpoohs

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-22 19:59:50

#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;
        sum+=(v-u);
        ar[i].first=u;
        ar[i].second=1;
        ar[i+1].first=v;
        ar[i+1].second=-1;
    }
    sort(ar,ar+(2*n),comp);
    // for(int i=0;i<?
    // cout<<sum;
    int mean=sum/2;
    int count=0;
    int buak=0;
    int i=0;
    int cur;
    int go=ar[0].first;
    while(true){
        int cur=ar[i].first;
        // cout<<i<<' '<<2*n<<' '<<ar[i].first<<' '<<cur<<'\n';
        while(i<(2*n-1) and ar[i].first==cur){
            // cout<<i<<':'<<ar[i].second<<'\n';
            buak+=ar[i].second;
            i++;
            
        }
        // cout<<'a';
        if(buak!=0)
        go++;
        count+=buak;
        // cout<<buak<<' ';
        if(count>=mean){
            cout<< go-1;
            return 0;
        }
        
    }
    return 0;
}