Algoritmlarni loyihalash

2-misol:

Piramida asosida to`plamning birinchi elementi bo`yicha to`plamni saralash:

Dastur kodi:

#include

using namespace std;

int main()

{

priority_queue

> pq;

pq.push(make_pair(10, 200));

pq.push(make_pair(20, 100));

pq.push(make_pair(15, 400));

pair top = pq.top();

cout << top.first << " " << top.second;

return 0;

}

Dastur natijasi:

3-misol:

Piramida asosida to`plamning ixtiyoriy elementi bo`yicha to`plamni saralash:

Dastur kodi:

#include

using namespace std;

typedef pair pi;

int main()

{

priority_queue

, greater
> pq;

pq.push(make_pair(10, 200));

pq.push(make_pair(20, 100));

pq.push(make_pair(15, 400));

pair top = pq.top();

cout << top.first << " " << top.second;

return 0;

}

Dastur natijasi: