luogu P1168 中位数

最新推荐文章于 2023-07-10 09:31:55 发布

lcxdz

最新推荐文章于 2023-07-10 09:31:55 发布

阅读量91

点赞数

分类专栏：洛谷

本文链接：https://blog.csdn.net/Minelois/article/details/115473530

版权

洛谷专栏收录该内容

43 篇文章 0 订阅

订阅专栏

添加链接描述

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define MAXN 100005
#define MAXM 1000005
priority_queue<int, vector<int>, greater<int>>mi_q;//最小
priority_queue<int>mx_q;//最大
int main() {
	int n, x, mid = 0;
	scanf("%d", &n);
	scanf("%d", &x);
	printf("%d\n", x);
	mid = x;
	mi_q.push(x);
	for (int i = 2; i <= n; i++) {
		scanf("%d", &x);
		if (x > mi_q.top()) {
			mi_q.push(x);
		} else mx_q.push(x);
		if (i % 2 == 1) {
			//cout<<mx_q.size()<<"***"<<mi_q.size()<<endl;
			
			while (abs((int)mi_q.size() - (int)mx_q.size()) > 1) {
				if (mx_q.size() > mi_q.size()) {
					int t = mx_q.top();
					mi_q.push(t);
					mx_q.pop();
				} else {
					int t = mi_q.top();
					mx_q.push(t);
					mi_q.pop();
				}
			}
		if(mx_q.size()>mi_q.size())cout<<mx_q.top()<<endl;
		else cout<<mi_q.top()<<endl;
		}
	}
	return 0;

}