fork download 
  1. #include <iostream>
  2. #include <string>
  3. #include <algorithm>
  4. #include <cmath>
  5. #include <climits>
  6. #include <iomanip>
  7. #include <vector>
  8.  
  9. using namespace std;
  10. // P.Moriarty //
  11. #define AAD ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr);
  12. long long fac(int n)
  13. {
  14. 	long long fact = 1;
  15. 	for (int i = 1;i <= n;i++)
  16. 	{
  17. 		fact *= i;
  18. 	}
  19. 	return fact;
  20. }
  21. long long per(int n, int j)
  22. {
  23. 	long long p = 1;
  24. 	for (int i = n; i > n - j; i--)
  25. 	{
  26. 		p *= i;
  27. 	}
  28. 	return p;
  29. }
  30. bool lucky(int ch)
  31. {
  32. 	bool l = true;
  33.  
  34. 	while (ch > 0)
  35. 	{
  36. 		int d = ch % 10;
  37. 		if (d == 7 || d == 4)
  38. 		{
  39. 			ch /= 10;
  40. 		}
  41. 		else
  42. 		{
  43. 			l = false;
  44. 			break;
  45. 		}
  46. 	}
  47.  
  48. 	return l;
  49.  
  50. }
  51. int pro(int x, int i)
  52. {
  53. 	int r = 1;
  54. 	for (int j = 1;j <= i;j++)
  55. 	{
  56. 		r *= x;
  57. 	}
  58. 	return r;
  59. }
  60.  
  61. bool prime(int x) {
  62. 	if (x <= 1) return false;
  63. 	if (x == 2 || x == 3) return true;
  64. 	if (x % 2 == 0 || x % 3 == 0) return false;
  65.  
  66. 	for (int i = 5; i <= sqrt(x); i += 6) {
  67. 		if (x % i == 0 || x % (i + 2) == 0) return false;
  68. 	}
  69.  
  70. 	return true;
  71. }
  72.  
  73. int f(string a, string b)
  74. {
  75. 	int c = 0;
  76. 	for (int i = 0;i < a.size();i++)
  77. 	{
  78. 		if (a[i] == b[i])
  79. 			c++;
  80. 	}
  81. 	return c;
  82. }
  83.  
  84. int main()
  85. {
  86. 	AAD;
  87. 	int n;
  88. 	cin >> n;
  89.  
  90. 	vector<pair<long long, long long>> p(n);
  91. 	for (int i = 0; i < n; i++) {
  92. 		cin >> p[i].first >> p[i].second;
  93. 	}
  94.  
  95. 	sort(p.begin(), p.end());
  96. 	long long l = p[0].first, r = p[0].second;
  97. 	vector<pair<long long, long long>> result;
  98. 	for (int i = 1; i < n; i++)
  99. 	{
  100. 		if (l <= p[i].first && r >= p[i].first && r <= p[i].second)
  101. 		{
  102. 			r = p[i].second;
  103. 		}
  104. 		else
  105. 		{
  106. 			result.push_back(pair<long long, long long>(l, r));
  107. 			l = p[i].first;
  108. 			r = p[i].second;
  109.  
  110. 		}
  111.  
  112. 	}
  113. 	for (int i = 0; i < result.size(); ++i) {
  114. 		cout << result[i].first << " " << result[i].second << endl;
  115. 	}
  116. 	cout << l << " " << r << endl;
  117.  
  118. }
  119.  
  120.  
  121.  
  122.  
  123.  
  124.  
Success #stdin #stdout 0.01s 5312KB
comments (?)
stdin 
Standard input is empty
stdout 
0 0
https://ideone.com/VW9UcR
language:
C++ (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!