Submission

Score: 0

User: APNICHANAN

Problemset: วันว่างๆ

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-06 16:54:41

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll cnt[1005] , maxi = 0 , mini = 1e9 ;
int main(){
    ll n ; cin >> n ;
    for (ll i = 1 ; i <= n ; i++){
        ll m ; cin >> m ;
        for (ll j = 0 ; j < m ; j++){
            ll a , b ; cin >> a >> b ;
            cnt[a]++ ;
            cnt[b-1]-- ;
            mini = min(mini,a) ;
            maxi = max(maxi,b) ;
        }
    }

    priority_queue<int> pq ;
    ll now = cnt[mini] ;
    for (int i = mini + 1 ; i <= maxi ; i++){
        if (now == 0 && i != maxi){
            pq.push(-i) ;
        }
        now += cnt[i] ;
    }
    if (pq.empty())
        cout << "-1" ;
    while (!pq.empty()){
        cout << -pq.top() << " " ;
        pq.pop() ;
    }
    cout << "\n" ;
}