Standard_template_library/Min_Heap.cpp at main · Samuvin/Standard_template_library · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int size, a;
    cin >> size;
    priority_queue<int, vector<int>, greater<int>> pq;
    for (int i = 0; i < size; i++)
    {
        cin >> a;
        pq.push(a);
    };
    cout << pq.size() << " "
         << "\n";
    cout << pq.top() << " "
         << "\n";
    while (!pq.empty())
    {
        cout << pq.top() << " ";
        pq.pop();
    }
    return 0;
    // using array as heap(priority-queue<int> pq(arr,arr+n));
}


//#include <iostream>
// #include <bits/stdc++.h>
// using namespace std;
// int main()
// {
//     int arr[] = {10, 2, 34, 15};
//     for (int i = 0; i < 4; i++)
//     {
//         arr[i] = -arr[i];
//     }
//     priority_queue<int> pq(arr, arr + 4);
//     cout << pq.top() * -1 << "\n";
//     while (!pq.empty())
//     {
//         cout << (pq.top() * -1) << " ";
//         pq.pop();
//     }
// }