Submission

[PPPPP][PPPPP][TSSSSSSSSS]

Score: 50

User: yumiKuri

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

Language: cpp

Time: 1.111 second

Submitted On: 2025-03-22 14:36:18

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

map<int,int> mp;

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);

    int n;
    cin >> n;
    int mx = 0,mn = INT_MAX;

    for(int i = 0; i < n; i++){
        int a,b;
        cin >> a >> b;
        mp[a]++;
        mp[b]--;
        mx = max(mx, b);
        mn = min(mn, a);
    }

    int sum = 0;
    int increase = 0;

    for(int i = mn; i <= mx; i++){
        increase += mp[i];
        sum += increase;
    }

    int k = sum/2;

    sum = 0, increase = 0;

    for(int i = mn; i <= mx; i++){
        increase += mp[i];
        sum += increase;
        if(sum >= k){
            cout << i;
            return 0;
        }
    }
}