fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main()
  5. {
  6.  
  7. priority_queue<int>maxHeap;
  8.  
  9. maxHeap.push(50);
  10. maxHeap.push(15);
  11. maxHeap.push(20);
  12. maxHeap.push(60);
  13.  
  14. // while(maxHeap.size() > 0)
  15. // {
  16. // cout<<maxHeap.top()<<" ";
  17. // maxHeap.pop();
  18. // }
  19.  
  20. priority_queue<int, vector<int>, greater<int> >minHeap;
  21. minHeap.push(20);
  22. minHeap.push(15);
  23. minHeap.push(40);
  24. minHeap.push(25);
  25.  
  26. while(minHeap.size() > 0)
  27. {
  28. cout<<minHeap.top()<<" ";
  29. minHeap.pop();
  30. }
  31.  
  32.  
  33.  
  34.  
  35. // vector<int>v[10]; //1D Array //dynamic // Created with linked list but act as an array
  36. //
  37. // v[4].push_back(10);
  38. // v[4].push_back(20);
  39. // for(int i = 0; i < v[4].size(); i++)
  40. // {
  41. // cout<<v[4][i]<<" ";
  42. // }
  43.  
  44. // vector<string>s(5);
  45. // vector<float>f[7];
  46. // vector<vector<string> >ch;
  47.  
  48.  
  49.  
  50.  
  51. }
  52.  
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
15 20 25 40