created min-heap priority queue

priority_queue/min-heap priority queue

@@ -0,0 +1,25 @@
+# min-heap priority_queue
+
+**Description** : priority_queue that arranges elements in ascending order.
+
+**Syntax** : priority_queue<type, vector<type>, greater<type>> pq; 
+
+**Example**:
+``` cpp
+
+   // create a priority queue of int
+  // arranges elements in ascending order
+  std::priority_queue<int, vector<int>, greater<int>> numbers;
+
+  // add items to priority_queue
+  numbers.push(1);
+  numbers.push(20);
+  numbers.push(7);
+
+  // print element with highest priority
+  cout << "Top element: " << numbers.top();
+
+
+```
+
+