fork download
  1. #include<bits/stdc++.h>
  2. #define FAST() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  3. #define loop(n) for (int i = 0; i < n; i++)
  4. #define loop2(n) for (int j = 0; j < n; j++)
  5. #define fr(i, a, n) for(int i = a; i <= n; i++)
  6. #define pb push_back
  7. #define all(v) v.begin(),v.end()
  8. #define sz(v) ((int) ((v).size()))
  9. #define in(v,n) for(int i=0 ;i<n;i++) cin>>v[i];
  10. #define out(v,n) for(int i=0;i<n;i++) cout << v[i] <<" ";
  11. #define el cout<<endl;
  12. #define pi 3.14159265359
  13. typedef long long ll;
  14. //typedef vector<int> vi;
  15. using namespace std;
  16.  
  17. bool prec (int x, int y)
  18. {
  19. return x>y;
  20. }
  21. //LCM(a,b) = (a*b) / gcd(a,b)
  22. int gcd(int a,int b);
  23. ll fastpower(ll b,ll p);
  24. void selection_Sort(int arr[], int n);
  25. void Bubble_sort(int arr[], int n);
  26. bool isPrime(int n);
  27. int maxElement(stack<int> x )
  28. {
  29. int mx=0;
  30. while(!x.empty())
  31. {
  32. if(x.top() > mx)
  33. mx = x.top();
  34. x.pop();
  35. }
  36. return mx;
  37. }
  38. void solve()
  39. {
  40. int n,x,mx=0,q;
  41. cin>>n;
  42. stack<int> s;
  43. multiset<int, greater<int>> se;
  44. while(n--)
  45. {
  46. cin>>q;
  47. if(q==1)
  48. {
  49. cin>>x;
  50. s.push(x);
  51. }
  52. else if(q==2)
  53. {
  54. if(!s.empty())
  55. {
  56. s.pop();
  57. }
  58. }
  59. else
  60. {
  61. cout<<maxElement(s)<<endl;
  62. }
  63. }
  64. }
  65. int main()
  66. {
  67. FAST()
  68. int t;
  69. // cin>>t;
  70. // while(t--)
  71. solve();
  72. return 0;
  73. }
Success #stdin #stdout 0.01s 5264KB
stdin
Standard input is empty
stdout
Standard output is empty