Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-22 21:34:31

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    int n;
    int book = 0;
    int pos;
    int k[101][2];
    cin >> n;
    vector <int> nums;

    for (int i = 0 ; i < n ; i++){
        cin >> k[i][0] >> k[i][1];
    }

    for (int i = 0 ; i < n ; i++){
        book += k[i][1] - k[i][0];
    }
    pos = book/2;

    for (int i = 0 ; i < n ; i++){
        for (int j = k[i][0] ; j < k[i][1] ; j++){
            nums.push_back(j);
        }
    }
    sort(nums.begin(), nums.end());
    cout << nums.at(pos - 1);

    return 0;
}