Submission

[P-SSS][SSSSS][SSSSSSSSSS]

Score: 0

User: nongbilly

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-24 22:16:12

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

int main(){
    int n;
    cin >> n;
    
    vector<int> l(n), r(n);
    int tt = 0;

    for(int i = 0; i < n; i++){
        cin >> l[i] >> r[i];
        tt += r[i] - l[i];
    }

    int find = tt / 2;

    for(int i = 0; i < n; i++){
        find -= r[i] - l[i];
        if(find < 0){
            find = r[i] - l[i] + find - 1;
            cout << l[i] + find << endl;
            return 0;
        }
        if(find == 0){
            cout << r[i] - 1;
            return 0;
        }
    }
}