Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-22 21:59:09

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

int main(){
    int n;
    int book = 0;
    int pos;
    int k[101][2];
    cin >> n;
    set <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];
    }
    for (int i = 0 ; i < n ; i++){
        for (int j = k[i][0] ; j < k[i][1] ; j++){
            nums.insert(j);
        }
    }
    vector<int> pages(nums.begin(), nums.end());
    pos = pages.size() / 2;
    if (pages.size() % 2 == 0){
        pos--;
    }
    
    cout << pages.at(pos);

    return 0;
}