From bc4f9f5cb6c0f85f960dd3a9d903b693b52ca884 Mon Sep 17 00:00:00 2001
From: Nallam Sriya Radhika <91793895+sriyaradhika@users.noreply.github.com>
Date: Sun, 6 Nov 2022 01:03:53 +0530
Subject: [PATCH] Create min-heap priority queue

In this type of priority queue, the smallest element gets the highest priority.
---
 priority_queue/min-heap priority queue | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 priority_queue/min-heap priority queue

diff --git a/priority_queue/min-heap priority queue b/priority_queue/min-heap priority queue
new file mode 100644
index 00000000..80a50407
--- /dev/null
+++ b/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();
+
+
+```
+
+