-
Notifications
You must be signed in to change notification settings - Fork 1
/
sjtu-oj1050.cpp
80 lines (76 loc) · 1.17 KB
/
sjtu-oj1050.cpp
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
#include <stdio.h>
#include <queue>
using namespace std;
struct comp
{
bool operator()(int a, int b)
{
return a > b;
}
};
struct girl_group
{
priority_queue<int, vector<int>, comp> pq;
girl_group(int ele)
{
pq.push(ele);
}
void delete_min()
{
pq.pop();
}
void add_in(int new_one)
{
pq.push(new_one);
}
void merge_with(girl_group &another)
{
int tmp;
while (!another.pq.empty())
{
tmp = another.pq.top();
this->add_in(tmp);
another.pq.pop();
}
}
};
int main()
{
int N, M;
cin >> N >> M;
vector<girl_group> v;
int tmp;
for (int i = 0; i < N; i++)
{
scanf("%d", &tmp);
v.push_back(girl_group(tmp));
}
int order, num1, num2;
for (int i = 0; i < M; i++)
{
scanf("%d", &order);
if (order == 0)
{
scanf("%d%d", &num1, &num2);
v[num1].merge_with(v[num2]);
}
if (order == 1)
{
scanf("%d", &num1);
if (v[num1].pq.empty())
printf("-1\n");
else
{
printf("%d\n", v[num1].pq.top());
v[num1].delete_min();
}
}
if (order == 2)
{
scanf("%d%d", &num1, &num2);
v[num1].add_in(num2);
}
}
return 0;
}