Submission

Status:

[-SSSS][SSSSS][SSSSSSSSSS]

Score: 0

User: nongbilly

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-24 22:45:52

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

int main() {
    int n;
    cin >> n;

    vector<pair<int, int>> lr(n);
    int tt = 0;

    for (int i = 0; i < n; i++) {
        cin >> lr[i].first >> lr[i].second;
        tt += lr[i].second - lr[i].first;
    }

    sort(lr.begin(), lr.end());

    int med = tt / 2;

    int c = 0;
    for (auto [L, R] : lr) {
        int size = R - L;

        if (c + size > med) {
            cout << L + (med - c) << endl;
            return 0;
        }

        c += size;
    }
}