-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path9-3.cpp
70 lines (60 loc) · 883 Bytes
/
9-3.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
#include <iostream>
#include <vector>
using namespace std;
class isLess {
public:
bool operator()(int a, int b) {
return a < b;
}
};
class SPQ {
public:
vector<int>v;
int size() {
return v.size();
}
bool empty() {
return v.empty();
}
void insert(int data) {
vector<int>::iterator i = v.begin();
isLess c;
if (empty()) {
v.push_back(data);
return;
}
else {
while (i != v.end() && c(data, *i)) {
i++;
}
v.insert(i, data);
}
return;
}
int min() {
return v.back();
}
void removemin() {
v.pop_back();
}
void print() {
for (vector<int>::iterator i = --v.end(); i != v.begin(); i--) {
cout << *i << " ";
}
cout << v.front() << endl;
return;
}
};
int main() {
int t, n, temp;
cin >> t;
while (t--) {
cin >> n;
SPQ q;
for (int i = 0; i < n; i++) {
cin >> temp;
q.insert(temp);
}
q.print();
}
}