传送门

简单贪心

——代码

1 #include <cstdio> 2 #include <iostream> 3 #include <algorithm> 4 5 int n, l, r; 6 struct node 7 p[50001]; 10 11 inline bool cmp(node x, node y) 12 15 16 inline int max(int x, int y) 17 20 21 int main() 22 36 if(!r) 37 41 else r = max(r, p[i].y); 42 } 43 printf("%d %d\n", l, r); 44 return 0; 45 }
View Code