Advertisement
Guest User

Untitled

a guest
Jul 1st, 2016
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.14 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define all(x) x.begin() , x.end()
  3. #define CLR( x ) memset(x , 0 , sizeof x)
  4. #define pb push_back
  5. #define mp make_pair
  6. #define f first
  7. #define s second
  8. #define ii pair<int , int>
  9. #define vi vector< int >
  10. #define vl vector < long long >
  11. #define vs vector < string >
  12. #define vb vector < bool >
  13. #define max3(a , b , c) max(a , max(b , c))
  14. #define min3(a , b , c) min(a , min(b , c))
  15. #define oo 10000000
  16. #define mod 1000000007
  17. typedef long long ll ;
  18. typedef unsigned long long ull ;
  19. using namespace std ;
  20. stack<int> sorting ;
  21. priority_queue<int> pq;
  22. void re()
  23. {
  24. if(sorting.empty())
  25. return ;
  26. int inPut = sorting.top() ;
  27. sorting.pop() ;
  28. re() ;
  29. pq.push(inPut) ;
  30. }
  31. void addToStack()
  32. {
  33. if(pq.empty())
  34. return ;
  35. int inPut = pq.top() ;
  36. pq.pop() ;
  37. addToStack() ;
  38. sorting.push(inPut) ;
  39. }
  40. int main()
  41. {
  42. ios_base::sync_with_stdio(0);
  43. sorting.push(5) ;
  44. sorting.push(6) ;
  45. sorting.push(4) ;
  46. re() ;
  47. addToStack() ;
  48. while(!sorting.empty())
  49. {
  50. cout << sorting.top() << " " ;
  51. sorting.pop() ;
  52. }
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement