Submission

Score: 100

User: Pxnny

Problemset: วันว่างๆ

Language: cpp

Time: 0.015 second

Submitted On: 2026-03-20 08:54:44

#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<pii> v;

    while(n--){
        int m;
        cin >> m;
        for(int i = 0; i < m; i++){
            int st, e;
            cin >> st >> e;
            v.push_back({st, e});
        }
    }

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

    vector<pii> merged;
    for(auto [l, r] : v){
        if(merged.empty() || l > merged.back().second){
            merged.push_back({l, r});
        }else{
            merged.back().second = max(merged.back().second, r);
        }
    }

    bool yes = false;
    for(int i = 0; i < (int)merged.size() - 1; i++){
        if(merged[i].second < merged[i+1].first){
            cout << merged[i].second << " " << merged[i+1].first << " ";
            yes = true;
        }
    }

    if(!yes) cout << -1;
}