40 lines
673 B
C++
40 lines
673 B
C++
#include <iostream>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
using namespace std;
|
|
int main() {
|
|
|
|
int n;
|
|
cin >> n;
|
|
vector<pair<int,int>> seg(n);
|
|
for(int i = 0; i < n; i++) {
|
|
cin >> seg[i].first >> seg[i].second;
|
|
}
|
|
sort(seg.begin(), seg.end(),
|
|
[](const pair<int,int>& a, const pair<int,int>& b) {
|
|
return a.second < b.second;
|
|
});
|
|
|
|
vector<int> ans;
|
|
int i = 0;
|
|
while(i < n) {
|
|
int p = seg[i].second;
|
|
ans.push_back(p);
|
|
while(i < n && seg[i].first <= p) {
|
|
i++;
|
|
}
|
|
}
|
|
for(int x : ans) {
|
|
cout << x << " ";
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
2 6
|
|
1 7
|
|
5 8
|
|
7 9
|
|
9 10
|
|
*/ |