fork download
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <string.h>
  5. #include <bits/stdc++.h>
  6. #include <cstdlib>
  7. #include <time.h>
  8. #include <fstream>
  9. #include <iterator>
  10. #include <utility>
  11. #include <algorithm>
  12. #include <set>
  13. #include <map>
  14. #include <bitset>
  15. using namespace std;
  16.  
  17. #define ll long long
  18. #define ld long double
  19. typedef vector<int> vi;
  20. typedef multiset<int> mi;
  21. typedef multiset<ll> mll;
  22. typedef vector<ll> vll;
  23. typedef vector<bool> vb;
  24. typedef vector<vector<int>> _2vi;
  25. typedef vector<vector<ll>> _2vll;
  26. #define all(v) ((v).begin()), ((v).end())
  27. #define sz(v) ((ll)((v).size()))
  28.  
  29. #define vinp(v, n) \
  30.   for (ll i = 0; i < (n); i++) \
  31.   cin >> (v)[i]
  32. #define printv(v) \
  33.   for (auto i : (v)) \
  34.   cout << i << " "
  35. #define Bustany \
  36.   ios::sync_with_stdio(0); \
  37.   cin.tie(0); \
  38.   cout.tie(0);
  39. #define fr0(i, n) for (int(i) = 0; (i) < (n); (i)++)
  40. #define fr1(i, n) for (int(i) = 1; (i) < (n); (i)++)
  41. #define _CRT_SECURE_NO_WARNING
  42. const ll MOD = 1000000007;
  43.  
  44.  
  45.  
  46. void solve()
  47. {
  48. ll n;
  49. cin >> n;
  50. vector<pair<ll, ll>> v(n);
  51. for(int i=0;i<n;i++)
  52. {
  53. cin >> v[i].first >> v[i].second;
  54. }
  55. sort(all(v), greater<pair<ll,ll>>());
  56. ll t = 1;
  57. ll mn=v.front().first;
  58. ll mx=t;
  59. // 1 3
  60. // 2 4
  61. // 4 5
  62. for(int i=1;i<n;i++)
  63. {
  64. if(v[i].second>=mn){
  65. t++;
  66. mx=max(t,mx);
  67. }
  68. }
  69. cout << mx;
  70. }
  71.  
  72. int main()
  73. {
  74. Bustany;
  75. int t = 1;
  76. // cin >> t;
  77. while (t--)
  78. {
  79. solve();
  80. }
  81. }
Success #stdin #stdout 0.01s 5292KB
stdin
Standard input is empty
stdout
540