Submission

Status:

[P-SSS][SSSSS][SSSSSSSSSS]

Subtask/Task Score:

{0/20}{0/30}{0/50}

Score: 0

User: fillhavertz

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-14 14:00:02

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long long n;
    cin >> n;
    vector<pair<long long, long long>> pp(n);
    long long total = 0;
    for (long long i = 0; i < n; i++) {
        cin >> pp[i].first >> pp[i].second;
        total += (pp[i].second - pp[i].first); // total number of elements
    }

    long long medianPos = (total - 1) / 2; // 0-based index
    sort(pp.begin(), pp.end());

    long long count = 0;
    for (auto [l, r] : pp) {
        long long len = r - l;
        if (count + len > medianPos) {
            cout << l + (medianPos - count) << '\n';
            break;
        }
        count += len;
    }

    return 0;
}