mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 17:52:02 +00:00
32 lines
682 B
C++
32 lines
682 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
int main() {
|
|
int n, a[100005], k;
|
|
priority_queue<int, vector<int>, less<int> > s;
|
|
priority_queue<int, vector<int>, greater<int> > l;
|
|
cin >> n;
|
|
for (int i = 1; i <= n; i++) {
|
|
cin >> a[i];
|
|
k = i / 2 + 1;
|
|
if (!l.empty() && a[i] >= l.top()) {
|
|
s.push(a[i]);
|
|
} else {
|
|
l.push(a[i]);
|
|
}
|
|
while (l.size() < k) {
|
|
l.push(s.top());
|
|
s.pop();
|
|
}
|
|
while (s.size() < k) {
|
|
s.push(l.top());
|
|
l.pop();
|
|
}
|
|
if (i % 2) {
|
|
cout << s.top() << endl;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|