Pagini recente » Cod sursa (job #2981232) | Cod sursa (job #2633119) | Cod sursa (job #2049137) | Cod sursa (job #3254852) | Cod sursa (job #3292582)
#include <bits/stdc++.h>
#define pii pair<int,int>
using namespace std;
ifstream f("mergeheap.in");
ofstream g("mergeheap.out");
int n,m,cer,x,y;
priority_queue <int> pq[120];
int32_t main()
{
f>>n>>m;
for(int i=1; i<=m; i++)
{
f>>cer>>x;
if(cer==1)
f>>y, pq[x].push(y);
if(cer==2)
g<<pq[x].top()<<'\n', pq[x].pop();
if(cer==3)
{
f>>y;
if(pq[x].size()<pq[y].size())
swap(pq[x],pq[y]);
while(!pq[y].empty())
pq[x].push(pq[y].top()), pq[y].pop();
}
}
return 0;
}