Submission

Score: 0

User: maxprogoji

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-13 12:10:17

#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
    int n;
    map<int, int> freq, swap;
    multiset<pair<int,int>> ss;
    cin >> n;
    for(int i = 0; i < n; i++){
        int start, end;
        cin >> start >> end;
        for(int j = start; j < end; j++) freq[j]++;
    }
    for(auto& i : freq) ss.insert({i.second,i.first});
    if(ss.size() % 2 != 0){
        auto it = ss.begin();
        advance(it, ss.size() / 2 - 1);
        cout << (*it).second;
    }
    else{
        auto it = ss.begin();
        advance(it, ss.size() / 2 - 1);
        int a = (*it).second;
        next(it);
        cout << (a + (*it).second) / (double) 2;
    }
}