Submission

Compilation Error

Score: 0

User: nongbilly

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

Language: cpp

Time: 0.000 second

Submitted On: 2025-03-24 22:30:59

#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.first >> lr.second;
        tt += lr.second - lr.first;
    }

    sort(lr.begin(), lr.end());
    int find = tt / 2;

    int prev = 0, cur;
    for(int i = 0; i < n; i++){
        cur = l[i];
        if(cur < prev){
            l[i] = prev - 1;
        }
        if(l[i] >= r[i]){
            continue;
        }

        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;
        }
        prev = r[i];
    }
}