Cod sursa(job #2906137)
Utilizator | Data | 24 mai 2022 23:44:25 | |
---|---|---|---|
Problema | Heapuri cu reuniune | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("mergeheap.in");
ofstream g("mergeheap.out");
priority_queue <unsigned int> h[101];
int N,Q,operatie,a,b,i;
int main()
{
f>>N>>Q;
for(i=0; i<Q; ++i)
{
f>>operatie;
if(operatie==1)
{
f>>a>>b;
h[a].push(b);
}
if(operatie==2)
{
f>>a;
g<<h[a].top()<<"\n";
h[a].pop();
}
if(operatie==3)
{
f>>a>>b;
while(!h[a].empty())
{
h[b].push(h[a].top());
h[a].pop();
}
}
}
return 0;
}