Updated

Author: codewithdev

20- Heap/Priority_queue-II.cpp

@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+#include<vector>
+using namespace std;
+class Person{
+public:
+	string name;
+	int age;
+	Person(string n, int a){
+		name=n;
+		age=a;
+	}
+};
+class PersonCompare{
+public: 
+	bool operator()(Person A, Person B){
+		return A.age<B.age;
+	}
+};
+
+int main(){
+    int n;
+    cin>>n;
+    priority_queue<Person,vector<int>,PersonCompare>pq;
+    for(int i=0;i<n;i++){
+    	string name;
+    	int age;
+    	cin>>name>>age;
+    	Person p(name,age);
+        pq.push(p);
+    }
+    return 0;
+
+}

20- Heap/connectRopesProbelem.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+int join_ropes(int ropes[],int n){
+	priority_queue<int,vector<int>,greater<int> > pq(ropes,ropes+n);
+	int cost=0;
+	while(pq.size()>1){
+		int A= pq.top();
+		pq.pop();
+		int B= pq.top();
+		pq.pop();
+		int new_rope= A+B;
+		cost+= new_rope;
+		pq.push(new_rope);
+	}
+	return cost;
+}
+int main(){
+	int ropes[]= {4,3,2,6};
+	int n=4;
+	cout<<join_ropes(ropes,n)<<endl;
+}

20- Heap/priorty_queue.cpp

@@ -0,0 +1,15 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+   int n;
+   cin>>n;
+   priority_queue<int, std::vector<int>,greater<int>>pq;
+   for(int i=0;i<n;i++){
+   	int no;cin>>no;
+   	pq.push(no);
+   }
+   while(!pq.empty()){
+   	cout<<pq.top()<<" ";
+   	pq.pop();
+   }
+}