Submission

Score: 50

User: APNICHANAN

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

Language: cpp

Time: 0.375 second

Submitted On: 2026-02-25 07:53:22

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int a[n], b[n], sum = 0;
    priority_queue<int> bk;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i];
        sum += b[i] - a[i];
        for (int j = a[i]; j < b[i]; j++)
            bk.push(-j);
    }

    int med = sum / 2;
    for (int i = 0; i < med - 1; i++)
        bk.pop();
    cout << -bk.top() << endl;
}